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

Theorem setind 4282
Description: Set (epsilon) induction. Theorem 5.22 of [TakeutiZaring] p. 21. (Contributed by NM, 17-Sep-2003.)
Assertion
Ref Expression
setind  |-  ( A. x ( x  C_  A  ->  x  e.  A
)  ->  A  =  _V )
Distinct variable group:    x, A

Proof of Theorem setind
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 dfss2 2988 . . . 4  |-  ( x 
C_  A  <->  A. y
( y  e.  x  ->  y  e.  A ) )
21imbi1i 236 . . 3  |-  ( ( x  C_  A  ->  x  e.  A )  <->  ( A. y ( y  e.  x  ->  y  e.  A )  ->  x  e.  A ) )
32albii 1399 . 2  |-  ( A. x ( x  C_  A  ->  x  e.  A
)  <->  A. x ( A. y ( y  e.  x  ->  y  e.  A )  ->  x  e.  A ) )
4 setindel 4281 . 2  |-  ( A. x ( A. y
( y  e.  x  ->  y  e.  A )  ->  x  e.  A
)  ->  A  =  _V )
53, 4sylbi 119 1  |-  ( A. x ( x  C_  A  ->  x  e.  A
)  ->  A  =  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1282    = wceq 1284    e. wcel 1433   _Vcvv 2601    C_ wss 2973
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  ax-setind 4280
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-ral 2353  df-v 2603  df-in 2979  df-ss 2986
This theorem is referenced by:  setind2  4283
  Copyright terms: Public domain W3C validator