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

Theorem bj-inf2vnlem1 15126
Description: Lemma for bj-inf2vn 15130. Remark: unoptimized proof (have to use more deduction style). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-inf2vnlem1 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → Ind 𝐴)
Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem bj-inf2vnlem1
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 biimpr 130 . . . . 5 ((𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴))
2 jaob 711 . . . . . 6 (((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴) ↔ ((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)))
32biimpi 120 . . . . 5 (((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴) → ((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)))
4 simpl 109 . . . . . 6 (((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)) → (𝑥 = ∅ → 𝑥𝐴))
5 eleq1 2252 . . . . . 6 (𝑥 = ∅ → (𝑥𝐴 ↔ ∅ ∈ 𝐴))
64, 5mpbidi 151 . . . . 5 (((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)) → (𝑥 = ∅ → ∅ ∈ 𝐴))
71, 3, 63syl 17 . . . 4 ((𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → (𝑥 = ∅ → ∅ ∈ 𝐴))
87alimi 1466 . . 3 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∀𝑥(𝑥 = ∅ → ∅ ∈ 𝐴))
9 exim 1610 . . 3 (∀𝑥(𝑥 = ∅ → ∅ ∈ 𝐴) → (∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴))
10 0ex 4145 . . . . . 6 ∅ ∈ V
1110isseti 2760 . . . . 5 𝑥 𝑥 = ∅
12 pm2.27 40 . . . . 5 (∃𝑥 𝑥 = ∅ → ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∃𝑥∅ ∈ 𝐴))
1311, 12ax-mp 5 . . . 4 ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∃𝑥∅ ∈ 𝐴)
14 bj-ex 14918 . . . 4 (∃𝑥∅ ∈ 𝐴 → ∅ ∈ 𝐴)
1513, 14syl 14 . . 3 ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∅ ∈ 𝐴)
168, 9, 153syl 17 . 2 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∅ ∈ 𝐴)
173simprd 114 . . . . . 6 (((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴) → (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴))
181, 17syl 14 . . . . 5 ((𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴))
1918alimi 1466 . . . 4 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∀𝑥(∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴))
20 eqid 2189 . . . . 5 suc 𝑧 = suc 𝑧
21 suceq 4417 . . . . . . 7 (𝑦 = 𝑧 → suc 𝑦 = suc 𝑧)
2221eqeq2d 2201 . . . . . 6 (𝑦 = 𝑧 → (suc 𝑧 = suc 𝑦 ↔ suc 𝑧 = suc 𝑧))
2322rspcev 2856 . . . . 5 ((𝑧𝐴 ∧ suc 𝑧 = suc 𝑧) → ∃𝑦𝐴 suc 𝑧 = suc 𝑦)
2420, 23mpan2 425 . . . 4 (𝑧𝐴 → ∃𝑦𝐴 suc 𝑧 = suc 𝑦)
25 vex 2755 . . . . . 6 𝑧 ∈ V
2625bj-sucex 15079 . . . . 5 suc 𝑧 ∈ V
27 eqeq1 2196 . . . . . . 7 (𝑥 = suc 𝑧 → (𝑥 = suc 𝑦 ↔ suc 𝑧 = suc 𝑦))
2827rexbidv 2491 . . . . . 6 (𝑥 = suc 𝑧 → (∃𝑦𝐴 𝑥 = suc 𝑦 ↔ ∃𝑦𝐴 suc 𝑧 = suc 𝑦))
29 eleq1 2252 . . . . . 6 (𝑥 = suc 𝑧 → (𝑥𝐴 ↔ suc 𝑧𝐴))
3028, 29imbi12d 234 . . . . 5 (𝑥 = suc 𝑧 → ((∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴) ↔ (∃𝑦𝐴 suc 𝑧 = suc 𝑦 → suc 𝑧𝐴)))
3126, 30spcv 2846 . . . 4 (∀𝑥(∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴) → (∃𝑦𝐴 suc 𝑧 = suc 𝑦 → suc 𝑧𝐴))
3219, 24, 31syl2im 38 . . 3 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → (𝑧𝐴 → suc 𝑧𝐴))
3332ralrimiv 2562 . 2 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∀𝑧𝐴 suc 𝑧𝐴)
34 df-bj-ind 15083 . 2 (Ind 𝐴 ↔ (∅ ∈ 𝐴 ∧ ∀𝑧𝐴 suc 𝑧𝐴))
3516, 33, 34sylanbrc 417 1 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → Ind 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 709  wal 1362   = wceq 1364  wex 1503  wcel 2160  wral 2468  wrex 2469  c0 3437  suc csuc 4380  Ind wind 15082
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-nul 4144  ax-pr 4224  ax-un 4448  ax-bd0 14969  ax-bdor 14972  ax-bdex 14975  ax-bdeq 14976  ax-bdel 14977  ax-bdsb 14978  ax-bdsep 15040
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-dif 3146  df-un 3148  df-nul 3438  df-sn 3613  df-pr 3614  df-uni 3825  df-suc 4386  df-bdc 14997  df-bj-ind 15083
This theorem is referenced by:  bj-inf2vn  15130  bj-inf2vn2  15131
  Copyright terms: Public domain W3C validator