Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-inf2vnlem1 Unicode version

Theorem bj-inf2vnlem1 16910
Description: Lemma for bj-inf2vn 16914. Remark: unoptimized proof (have to use more deduction style). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-inf2vnlem1  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  -> Ind  A )
Distinct variable group:    x, A, y

Proof of Theorem bj-inf2vnlem1
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 biimpr 130 . . . . 5  |-  ( ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  -> 
( ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y )  ->  x  e.  A ) )
2 jaob 722 . . . . . 6  |-  ( ( ( x  =  (/)  \/ 
E. y  e.  A  x  =  suc  y )  ->  x  e.  A
)  <->  ( ( x  =  (/)  ->  x  e.  A )  /\  ( E. y  e.  A  x  =  suc  y  ->  x  e.  A )
) )
32biimpi 120 . . . . 5  |-  ( ( ( x  =  (/)  \/ 
E. y  e.  A  x  =  suc  y )  ->  x  e.  A
)  ->  ( (
x  =  (/)  ->  x  e.  A )  /\  ( E. y  e.  A  x  =  suc  y  ->  x  e.  A )
) )
4 simpl 109 . . . . . 6  |-  ( ( ( x  =  (/)  ->  x  e.  A )  /\  ( E. y  e.  A  x  =  suc  y  ->  x  e.  A ) )  -> 
( x  =  (/)  ->  x  e.  A ) )
5 eleq1 2301 . . . . . 6  |-  ( x  =  (/)  ->  ( x  e.  A  <->  (/)  e.  A
) )
64, 5mpbidi 151 . . . . 5  |-  ( ( ( x  =  (/)  ->  x  e.  A )  /\  ( E. y  e.  A  x  =  suc  y  ->  x  e.  A ) )  -> 
( x  =  (/)  -> 
(/)  e.  A )
)
71, 3, 63syl 17 . . . 4  |-  ( ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  -> 
( x  =  (/)  -> 
(/)  e.  A )
)
87alimi 1508 . . 3  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  ->  A. x ( x  =  (/)  ->  (/)  e.  A ) )
9 exim 1652 . . 3  |-  ( A. x ( x  =  (/)  ->  (/)  e.  A )  ->  ( E. x  x  =  (/)  ->  E. x (/) 
e.  A ) )
10 0ex 4255 . . . . . 6  |-  (/)  e.  _V
1110isseti 2830 . . . . 5  |-  E. x  x  =  (/)
12 pm2.27 40 . . . . 5  |-  ( E. x  x  =  (/)  ->  ( ( E. x  x  =  (/)  ->  E. x (/) 
e.  A )  ->  E. x (/)  e.  A
) )
1311, 12ax-mp 5 . . . 4  |-  ( ( E. x  x  =  (/)  ->  E. x (/)  e.  A
)  ->  E. x (/) 
e.  A )
14 bj-ex 16704 . . . 4  |-  ( E. x (/)  e.  A  -> 
(/)  e.  A )
1513, 14syl 14 . . 3  |-  ( ( E. x  x  =  (/)  ->  E. x (/)  e.  A
)  ->  (/)  e.  A
)
168, 9, 153syl 17 . 2  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  ->  (/) 
e.  A )
173simprd 114 . . . . . 6  |-  ( ( ( x  =  (/)  \/ 
E. y  e.  A  x  =  suc  y )  ->  x  e.  A
)  ->  ( E. y  e.  A  x  =  suc  y  ->  x  e.  A ) )
181, 17syl 14 . . . . 5  |-  ( ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  -> 
( E. y  e.  A  x  =  suc  y  ->  x  e.  A
) )
1918alimi 1508 . . . 4  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  ->  A. x ( E. y  e.  A  x  =  suc  y  ->  x  e.  A ) )
20 eqid 2238 . . . . 5  |-  suc  z  =  suc  z
21 suceq 4542 . . . . . . 7  |-  ( y  =  z  ->  suc  y  =  suc  z )
2221eqeq2d 2250 . . . . . 6  |-  ( y  =  z  ->  ( suc  z  =  suc  y 
<->  suc  z  =  suc  z ) )
2322rspcev 2929 . . . . 5  |-  ( ( z  e.  A  /\  suc  z  =  suc  z )  ->  E. y  e.  A  suc  z  =  suc  y )
2420, 23mpan2 429 . . . 4  |-  ( z  e.  A  ->  E. y  e.  A  suc  z  =  suc  y )
25 vex 2824 . . . . . 6  |-  z  e. 
_V
2625bj-sucex 16863 . . . . 5  |-  suc  z  e.  _V
27 eqeq1 2245 . . . . . . 7  |-  ( x  =  suc  z  -> 
( x  =  suc  y 
<->  suc  z  =  suc  y ) )
2827rexbidv 2551 . . . . . 6  |-  ( x  =  suc  z  -> 
( E. y  e.  A  x  =  suc  y 
<->  E. y  e.  A  suc  z  =  suc  y ) )
29 eleq1 2301 . . . . . 6  |-  ( x  =  suc  z  -> 
( x  e.  A  <->  suc  z  e.  A ) )
3028, 29imbi12d 234 . . . . 5  |-  ( x  =  suc  z  -> 
( ( E. y  e.  A  x  =  suc  y  ->  x  e.  A )  <->  ( E. y  e.  A  suc  z  =  suc  y  ->  suc  z  e.  A
) ) )
3126, 30spcv 2919 . . . 4  |-  ( A. x ( E. y  e.  A  x  =  suc  y  ->  x  e.  A )  ->  ( E. y  e.  A  suc  z  =  suc  y  ->  suc  z  e.  A ) )
3219, 24, 31syl2im 38 . . 3  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  -> 
( z  e.  A  ->  suc  z  e.  A
) )
3332ralrimiv 2622 . 2  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  ->  A. z  e.  A  suc  z  e.  A
)
34 df-bj-ind 16867 . 2  |-  (Ind  A  <->  (
(/)  e.  A  /\  A. z  e.  A  suc  z  e.  A )
)
3516, 33, 34sylanbrc 421 1  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  -> Ind  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720   A.wal 1400    = wceq 1402   E.wex 1545    e. wcel 2209   A.wral 2528   E.wrex 2529   (/)c0 3520   suc csuc 4505  Ind wind 16866
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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-nul 4254  ax-pr 4341  ax-un 4573  ax-bd0 16753  ax-bdor 16756  ax-bdex 16759  ax-bdeq 16760  ax-bdel 16761  ax-bdsep 16824
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-nul 3521  df-sn 3711  df-pr 3712  df-uni 3931  df-suc 4511  df-bj-ind 16867
This theorem is referenced by:  bj-inf2vn  16914  bj-inf2vn2  16915
  Copyright terms: Public domain W3C validator