ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  euotd Unicode version

Theorem euotd 4017
Description: Prove existential uniqueness for an ordered triple. (Contributed by Mario Carneiro, 20-May-2015.)
Hypotheses
Ref Expression
euotd.1  |-  ( ph  ->  A  e.  _V )
euotd.2  |-  ( ph  ->  B  e.  _V )
euotd.3  |-  ( ph  ->  C  e.  _V )
euotd.4  |-  ( ph  ->  ( ps  <->  ( a  =  A  /\  b  =  B  /\  c  =  C ) ) )
Assertion
Ref Expression
euotd  |-  ( ph  ->  E! x E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps ) )
Distinct variable groups:    a, b, c, x, A    B, a,
b, c, x    C, a, b, c, x    ph, a,
b, c, x
Allowed substitution hints:    ps( x, a, b, c)

Proof of Theorem euotd
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 euotd.1 . . . 4  |-  ( ph  ->  A  e.  _V )
2 euotd.2 . . . 4  |-  ( ph  ->  B  e.  _V )
3 euotd.3 . . . 4  |-  ( ph  ->  C  e.  _V )
4 otexg 3993 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  _V  /\  C  e.  _V )  ->  <. A ,  B ,  C >.  e. 
_V )
51, 2, 3, 4syl3anc 1170 . . 3  |-  ( ph  -> 
<. A ,  B ,  C >.  e.  _V )
6 euotd.4 . . . . . . . . . . . . 13  |-  ( ph  ->  ( ps  <->  ( a  =  A  /\  b  =  B  /\  c  =  C ) ) )
76biimpa 290 . . . . . . . . . . . 12  |-  ( (
ph  /\  ps )  ->  ( a  =  A  /\  b  =  B  /\  c  =  C ) )
8 vex 2605 . . . . . . . . . . . . 13  |-  a  e. 
_V
9 vex 2605 . . . . . . . . . . . . 13  |-  b  e. 
_V
10 vex 2605 . . . . . . . . . . . . 13  |-  c  e. 
_V
118, 9, 10otth 4005 . . . . . . . . . . . 12  |-  ( <.
a ,  b ,  c >.  =  <. A ,  B ,  C >.  <-> 
( a  =  A  /\  b  =  B  /\  c  =  C ) )
127, 11sylibr 132 . . . . . . . . . . 11  |-  ( (
ph  /\  ps )  -> 
<. a ,  b ,  c >.  =  <. A ,  B ,  C >. )
1312eqeq2d 2093 . . . . . . . . . 10  |-  ( (
ph  /\  ps )  ->  ( x  =  <. a ,  b ,  c
>. 
<->  x  =  <. A ,  B ,  C >. ) )
1413biimpd 142 . . . . . . . . 9  |-  ( (
ph  /\  ps )  ->  ( x  =  <. a ,  b ,  c
>.  ->  x  =  <. A ,  B ,  C >. ) )
1514impancom 256 . . . . . . . 8  |-  ( (
ph  /\  x  =  <. a ,  b ,  c >. )  ->  ( ps  ->  x  =  <. A ,  B ,  C >. ) )
1615expimpd 355 . . . . . . 7  |-  ( ph  ->  ( ( x  = 
<. a ,  b ,  c >.  /\  ps )  ->  x  =  <. A ,  B ,  C >. ) )
1716exlimdv 1741 . . . . . 6  |-  ( ph  ->  ( E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  ->  x  =  <. A ,  B ,  C >. ) )
1817exlimdvv 1819 . . . . 5  |-  ( ph  ->  ( E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  ->  x  =  <. A ,  B ,  C >. ) )
19 tru 1289 . . . . . . . . . . 11  |- T.
202adantr 270 . . . . . . . . . . . . 13  |-  ( (
ph  /\  a  =  A )  ->  B  e.  _V )
213ad2antrr 472 . . . . . . . . . . . . . 14  |-  ( ( ( ph  /\  a  =  A )  /\  b  =  B )  ->  C  e.  _V )
22 simpr 108 . . . . . . . . . . . . . . . . . . 19  |-  ( (
ph  /\  ( a  =  A  /\  b  =  B  /\  c  =  C ) )  -> 
( a  =  A  /\  b  =  B  /\  c  =  C ) )
2322, 11sylibr 132 . . . . . . . . . . . . . . . . . 18  |-  ( (
ph  /\  ( a  =  A  /\  b  =  B  /\  c  =  C ) )  ->  <. a ,  b ,  c >.  =  <. A ,  B ,  C >. )
2423eqcomd 2087 . . . . . . . . . . . . . . . . 17  |-  ( (
ph  /\  ( a  =  A  /\  b  =  B  /\  c  =  C ) )  ->  <. A ,  B ,  C >.  =  <. a ,  b ,  c
>. )
256biimpar 291 . . . . . . . . . . . . . . . . 17  |-  ( (
ph  /\  ( a  =  A  /\  b  =  B  /\  c  =  C ) )  ->  ps )
2624, 25jca 300 . . . . . . . . . . . . . . . 16  |-  ( (
ph  /\  ( a  =  A  /\  b  =  B  /\  c  =  C ) )  -> 
( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps ) )
27 a1tru 1301 . . . . . . . . . . . . . . . 16  |-  ( (
ph  /\  ( a  =  A  /\  b  =  B  /\  c  =  C ) )  -> T.  )
2826, 272thd 173 . . . . . . . . . . . . . . 15  |-  ( (
ph  /\  ( a  =  A  /\  b  =  B  /\  c  =  C ) )  -> 
( ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )  <-> T.  ) )
29283anassrs 1161 . . . . . . . . . . . . . 14  |-  ( ( ( ( ph  /\  a  =  A )  /\  b  =  B
)  /\  c  =  C )  ->  (
( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )  <-> T.  )
)
3021, 29sbcied 2851 . . . . . . . . . . . . 13  |-  ( ( ( ph  /\  a  =  A )  /\  b  =  B )  ->  ( [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )  <-> T.  )
)
3120, 30sbcied 2851 . . . . . . . . . . . 12  |-  ( (
ph  /\  a  =  A )  ->  ( [. B  /  b ]. [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )  <-> T.  )
)
321, 31sbcied 2851 . . . . . . . . . . 11  |-  ( ph  ->  ( [. A  / 
a ]. [. B  / 
b ]. [. C  / 
c ]. ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )  <-> T.  ) )
3319, 32mpbiri 166 . . . . . . . . . 10  |-  ( ph  ->  [. A  /  a ]. [. B  /  b ]. [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps ) )
3433spesbcd 2901 . . . . . . . . 9  |-  ( ph  ->  E. a [. B  /  b ]. [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps ) )
35 nfcv 2220 . . . . . . . . . 10  |-  F/_ b B
36 nfsbc1v 2834 . . . . . . . . . . 11  |-  F/ b
[. B  /  b ]. [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )
3736nfex 1569 . . . . . . . . . 10  |-  F/ b E. a [. B  /  b ]. [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )
38 sbceq1a 2825 . . . . . . . . . . 11  |-  ( b  =  B  ->  ( [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )  <->  [. B  / 
b ]. [. C  / 
c ]. ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
) )
3938exbidv 1747 . . . . . . . . . 10  |-  ( b  =  B  ->  ( E. a [. C  / 
c ]. ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )  <->  E. a [. B  / 
b ]. [. C  / 
c ]. ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
) )
4035, 37, 39spcegf 2682 . . . . . . . . 9  |-  ( B  e.  _V  ->  ( E. a [. B  / 
b ]. [. C  / 
c ]. ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )  ->  E. b E. a [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps ) ) )
412, 34, 40sylc 61 . . . . . . . 8  |-  ( ph  ->  E. b E. a [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps ) )
42 nfcv 2220 . . . . . . . . 9  |-  F/_ c C
43 nfsbc1v 2834 . . . . . . . . . . 11  |-  F/ c
[. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )
4443nfex 1569 . . . . . . . . . 10  |-  F/ c E. a [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )
4544nfex 1569 . . . . . . . . 9  |-  F/ c E. b E. a [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )
46 sbceq1a 2825 . . . . . . . . . 10  |-  ( c  =  C  ->  (
( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )  <->  [. C  / 
c ]. ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
) )
47462exbidv 1790 . . . . . . . . 9  |-  ( c  =  C  ->  ( E. b E. a (
<. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )  <->  E. b E. a [. C  / 
c ]. ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
) )
4842, 45, 47spcegf 2682 . . . . . . . 8  |-  ( C  e.  _V  ->  ( E. b E. a [. C  /  c ]. ( <. A ,  B ,  C >.  =  <. a ,  b ,  c
>.  /\  ps )  ->  E. c E. b E. a ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
) )
493, 41, 48sylc 61 . . . . . . 7  |-  ( ph  ->  E. c E. b E. a ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
)
50 excom13 1620 . . . . . . 7  |-  ( E. c E. b E. a ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )  <->  E. a E. b E. c ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
)
5149, 50sylib 120 . . . . . 6  |-  ( ph  ->  E. a E. b E. c ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
)
52 eqeq1 2088 . . . . . . . 8  |-  ( x  =  <. A ,  B ,  C >.  ->  ( x  =  <. a ,  b ,  c >.  <->  <. A ,  B ,  C >.  = 
<. a ,  b ,  c >. ) )
5352anbi1d 453 . . . . . . 7  |-  ( x  =  <. A ,  B ,  C >.  ->  ( ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  ( <. A ,  B ,  C >.  =  <. a ,  b ,  c >.  /\  ps ) ) )
54533exbidv 1791 . . . . . 6  |-  ( x  =  <. A ,  B ,  C >.  ->  ( E. a E. b E. c ( x  = 
<. a ,  b ,  c >.  /\  ps )  <->  E. a E. b E. c ( <. A ,  B ,  C >.  = 
<. a ,  b ,  c >.  /\  ps )
) )
5551, 54syl5ibrcom 155 . . . . 5  |-  ( ph  ->  ( x  =  <. A ,  B ,  C >.  ->  E. a E. b E. c ( x  = 
<. a ,  b ,  c >.  /\  ps )
) )
5618, 55impbid 127 . . . 4  |-  ( ph  ->  ( E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  x  =  <. A ,  B ,  C >. ) )
5756alrimiv 1796 . . 3  |-  ( ph  ->  A. x ( E. a E. b E. c ( x  = 
<. a ,  b ,  c >.  /\  ps )  <->  x  =  <. A ,  B ,  C >. ) )
58 eqeq2 2091 . . . . . 6  |-  ( y  =  <. A ,  B ,  C >.  ->  ( x  =  y  <->  x  =  <. A ,  B ,  C >. ) )
5958bibi2d 230 . . . . 5  |-  ( y  =  <. A ,  B ,  C >.  ->  ( ( E. a E. b E. c ( x  = 
<. a ,  b ,  c >.  /\  ps )  <->  x  =  y )  <->  ( E. a E. b E. c
( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  x  =  <. A ,  B ,  C >. ) ) )
6059albidv 1746 . . . 4  |-  ( y  =  <. A ,  B ,  C >.  ->  ( A. x ( E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  x  =  y )  <->  A. x
( E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  x  =  <. A ,  B ,  C >. ) ) )
6160spcegv 2687 . . 3  |-  ( <. A ,  B ,  C >.  e.  _V  ->  ( A. x ( E. a E. b E. c ( x  = 
<. a ,  b ,  c >.  /\  ps )  <->  x  =  <. A ,  B ,  C >. )  ->  E. y A. x ( E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  x  =  y ) ) )
625, 57, 61sylc 61 . 2  |-  ( ph  ->  E. y A. x
( E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  x  =  y ) )
63 df-eu 1945 . 2  |-  ( E! x E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  E. y A. x ( E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps )  <->  x  =  y ) )
6462, 63sylibr 132 1  |-  ( ph  ->  E! x E. a E. b E. c ( x  =  <. a ,  b ,  c
>.  /\  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    /\ w3a 920   A.wal 1283    = wceq 1285   T. wtru 1286   E.wex 1422    e. wcel 1434   E!weu 1942   _Vcvv 2602   [.wsbc 2816   <.cotp 3410
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-pow 3956  ax-pr 3972
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-eu 1945  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-rex 2355  df-v 2604  df-sbc 2817  df-un 2978  df-in 2980  df-ss 2987  df-pw 3392  df-sn 3412  df-pr 3413  df-op 3415  df-ot 3416
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator