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

Theorem tpid3g 3505
Description: Closed theorem form of tpid3 3506. (Contributed by Alan Sare, 24-Oct-2011.)
Assertion
Ref Expression
tpid3g  |-  ( A  e.  B  ->  A  e.  { C ,  D ,  A } )

Proof of Theorem tpid3g
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elisset 2613 . 2  |-  ( A  e.  B  ->  E. x  x  =  A )
2 3mix3 1109 . . . . . . 7  |-  ( x  =  A  ->  (
x  =  C  \/  x  =  D  \/  x  =  A )
)
32a1i 9 . . . . . 6  |-  ( A  e.  B  ->  (
x  =  A  -> 
( x  =  C  \/  x  =  D  \/  x  =  A ) ) )
4 abid 2069 . . . . . 6  |-  ( x  e.  { x  |  ( x  =  C  \/  x  =  D  \/  x  =  A ) }  <->  ( x  =  C  \/  x  =  D  \/  x  =  A ) )
53, 4syl6ibr 160 . . . . 5  |-  ( A  e.  B  ->  (
x  =  A  ->  x  e.  { x  |  ( x  =  C  \/  x  =  D  \/  x  =  A ) } ) )
6 dftp2 3441 . . . . . 6  |-  { C ,  D ,  A }  =  { x  |  ( x  =  C  \/  x  =  D  \/  x  =  A ) }
76eleq2i 2145 . . . . 5  |-  ( x  e.  { C ,  D ,  A }  <->  x  e.  { x  |  ( x  =  C  \/  x  =  D  \/  x  =  A ) } )
85, 7syl6ibr 160 . . . 4  |-  ( A  e.  B  ->  (
x  =  A  ->  x  e.  { C ,  D ,  A }
) )
9 eleq1 2141 . . . 4  |-  ( x  =  A  ->  (
x  e.  { C ,  D ,  A }  <->  A  e.  { C ,  D ,  A }
) )
108, 9mpbidi 149 . . 3  |-  ( A  e.  B  ->  (
x  =  A  ->  A  e.  { C ,  D ,  A }
) )
1110exlimdv 1740 . 2  |-  ( A  e.  B  ->  ( E. x  x  =  A  ->  A  e.  { C ,  D ,  A } ) )
121, 11mpd 13 1  |-  ( A  e.  B  ->  A  e.  { C ,  D ,  A } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ w3o 918    = wceq 1284   E.wex 1421    e. wcel 1433   {cab 2067   {ctp 3400
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 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3or 920  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-tp 3406
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator