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

Theorem bj-inf2vnlem1 14005
Description: Lemma for bj-inf2vn 14009. 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 129 . . . . 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 705 . . . . . 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 119 . . . . 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 108 . . . . . 6  |-  ( ( ( x  =  (/)  ->  x  e.  A )  /\  ( E. y  e.  A  x  =  suc  y  ->  x  e.  A ) )  -> 
( x  =  (/)  ->  x  e.  A ) )
5 eleq1 2233 . . . . . 6  |-  ( x  =  (/)  ->  ( x  e.  A  <->  (/)  e.  A
) )
64, 5mpbidi 150 . . . . 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 1448 . . 3  |-  ( A. x ( x  e.  A  <->  ( x  =  (/)  \/  E. y  e.  A  x  =  suc  y ) )  ->  A. x ( x  =  (/)  ->  (/)  e.  A ) )
9 exim 1592 . . 3  |-  ( A. x ( x  =  (/)  ->  (/)  e.  A )  ->  ( E. x  x  =  (/)  ->  E. x (/) 
e.  A ) )
10 0ex 4116 . . . . . 6  |-  (/)  e.  _V
1110isseti 2738 . . . . 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 13797 . . . 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 113 . . . . . 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 1448 . . . 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 2170 . . . . 5  |-  suc  z  =  suc  z
21 suceq 4387 . . . . . . 7  |-  ( y  =  z  ->  suc  y  =  suc  z )
2221eqeq2d 2182 . . . . . 6  |-  ( y  =  z  ->  ( suc  z  =  suc  y 
<->  suc  z  =  suc  z ) )
2322rspcev 2834 . . . . 5  |-  ( ( z  e.  A  /\  suc  z  =  suc  z )  ->  E. y  e.  A  suc  z  =  suc  y )
2420, 23mpan2 423 . . . 4  |-  ( z  e.  A  ->  E. y  e.  A  suc  z  =  suc  y )
25 vex 2733 . . . . . 6  |-  z  e. 
_V
2625bj-sucex 13958 . . . . 5  |-  suc  z  e.  _V
27 eqeq1 2177 . . . . . . 7  |-  ( x  =  suc  z  -> 
( x  =  suc  y 
<->  suc  z  =  suc  y ) )
2827rexbidv 2471 . . . . . 6  |-  ( x  =  suc  z  -> 
( E. y  e.  A  x  =  suc  y 
<->  E. y  e.  A  suc  z  =  suc  y ) )
29 eleq1 2233 . . . . . 6  |-  ( x  =  suc  z  -> 
( x  e.  A  <->  suc  z  e.  A ) )
3028, 29imbi12d 233 . . . . 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 2824 . . . 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 2542 . 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 13962 . 2  |-  (Ind  A  <->  (
(/)  e.  A  /\  A. z  e.  A  suc  z  e.  A )
)
3516, 33, 34sylanbrc 415 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 103    <-> wb 104    \/ wo 703   A.wal 1346    = wceq 1348   E.wex 1485    e. wcel 2141   A.wral 2448   E.wrex 2449   (/)c0 3414   suc csuc 4350  Ind wind 13961
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-nul 4115  ax-pr 4194  ax-un 4418  ax-bd0 13848  ax-bdor 13851  ax-bdex 13854  ax-bdeq 13855  ax-bdel 13856  ax-bdsb 13857  ax-bdsep 13919
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-un 3125  df-nul 3415  df-sn 3589  df-pr 3590  df-uni 3797  df-suc 4356  df-bdc 13876  df-bj-ind 13962
This theorem is referenced by:  bj-inf2vn  14009  bj-inf2vn2  14010
  Copyright terms: Public domain W3C validator