MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  moop2 Structured version   Unicode version

Theorem moop2 4591
Description: "At most one" property of an ordered pair. (Contributed by NM, 11-Apr-2004.) (Revised by Mario Carneiro, 26-Apr-2015.)
Hypothesis
Ref Expression
moop2.1  |-  B  e. 
_V
Assertion
Ref Expression
moop2  |-  E* x  A  =  <. B ,  x >.
Distinct variable group:    x, A
Allowed substitution hint:    B( x)

Proof of Theorem moop2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eqtr2 2461 . . . 4  |-  ( ( A  =  <. B ,  x >.  /\  A  =  <. [_ y  /  x ]_ B ,  y >.
)  ->  <. B ,  x >.  =  <. [_ y  /  x ]_ B , 
y >. )
2 moop2.1 . . . . . 6  |-  B  e. 
_V
3 vex 2980 . . . . . 6  |-  x  e. 
_V
42, 3opth 4571 . . . . 5  |-  ( <. B ,  x >.  = 
<. [_ y  /  x ]_ B ,  y >.  <->  ( B  =  [_ y  /  x ]_ B  /\  x  =  y )
)
54simprbi 464 . . . 4  |-  ( <. B ,  x >.  = 
<. [_ y  /  x ]_ B ,  y >.  ->  x  =  y )
61, 5syl 16 . . 3  |-  ( ( A  =  <. B ,  x >.  /\  A  =  <. [_ y  /  x ]_ B ,  y >.
)  ->  x  =  y )
76gen2 1592 . 2  |-  A. x A. y ( ( A  =  <. B ,  x >.  /\  A  =  <. [_ y  /  x ]_ B ,  y >. )  ->  x  =  y )
8 nfcsb1v 3309 . . . . 5  |-  F/_ x [_ y  /  x ]_ B
9 nfcv 2584 . . . . 5  |-  F/_ x
y
108, 9nfop 4080 . . . 4  |-  F/_ x <. [_ y  /  x ]_ B ,  y >.
1110nfeq2 2595 . . 3  |-  F/ x  A  =  <. [_ y  /  x ]_ B , 
y >.
12 csbeq1a 3302 . . . . 5  |-  ( x  =  y  ->  B  =  [_ y  /  x ]_ B )
13 id 22 . . . . 5  |-  ( x  =  y  ->  x  =  y )
1412, 13opeq12d 4072 . . . 4  |-  ( x  =  y  ->  <. B ,  x >.  =  <. [_ y  /  x ]_ B , 
y >. )
1514eqeq2d 2454 . . 3  |-  ( x  =  y  ->  ( A  =  <. B ,  x >. 
<->  A  =  <. [_ y  /  x ]_ B , 
y >. ) )
1611, 15mo4f 2316 . 2  |-  ( E* x  A  =  <. B ,  x >.  <->  A. x A. y ( ( A  =  <. B ,  x >.  /\  A  =  <. [_ y  /  x ]_ B ,  y >. )  ->  x  =  y ) )
177, 16mpbir 209 1  |-  E* x  A  =  <. B ,  x >.
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369   A.wal 1367    = wceq 1369    e. wcel 1756   E*wmo 2254   _Vcvv 2977   [_csb 3293   <.cop 3888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4418  ax-nul 4426  ax-pr 4536
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2573  df-ne 2613  df-rab 2729  df-v 2979  df-sbc 3192  df-csb 3294  df-dif 3336  df-un 3338  df-in 3340  df-ss 3347  df-nul 3643  df-if 3797  df-sn 3883  df-pr 3885  df-op 3889
This theorem is referenced by:  euop2  4596
  Copyright terms: Public domain W3C validator