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

Theorem setind 4595
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 ssalel 3185 . . . 4  |-  ( x 
C_  A  <->  A. y
( y  e.  x  ->  y  e.  A ) )
21imbi1i 238 . . 3  |-  ( ( x  C_  A  ->  x  e.  A )  <->  ( A. y ( y  e.  x  ->  y  e.  A )  ->  x  e.  A ) )
32albii 1494 . 2  |-  ( A. x ( x  C_  A  ->  x  e.  A
)  <->  A. x ( A. y ( y  e.  x  ->  y  e.  A )  ->  x  e.  A ) )
4 setindel 4594 . 2  |-  ( A. x ( A. y
( y  e.  x  ->  y  e.  A )  ->  x  e.  A
)  ->  A  =  _V )
53, 4sylbi 121 1  |-  ( A. x ( x  C_  A  ->  x  e.  A
)  ->  A  =  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1371    = wceq 1373    e. wcel 2177   _Vcvv 2773    C_ wss 3170
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188  ax-setind 4593
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-ral 2490  df-v 2775  df-in 3176  df-ss 3183
This theorem is referenced by:  setind2  4596
  Copyright terms: Public domain W3C validator