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

Theorem bj-inf2vnlem1 13852
Description: Lemma for bj-inf2vn 13856. 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 129 . . . . 5 ((𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴))
2 jaob 700 . . . . . 6 (((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴) ↔ ((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)))
32biimpi 119 . . . . 5 (((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴) → ((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)))
4 simpl 108 . . . . . 6 (((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)) → (𝑥 = ∅ → 𝑥𝐴))
5 eleq1 2229 . . . . . 6 (𝑥 = ∅ → (𝑥𝐴 ↔ ∅ ∈ 𝐴))
64, 5mpbidi 150 . . . . 5 (((𝑥 = ∅ → 𝑥𝐴) ∧ (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴)) → (𝑥 = ∅ → ∅ ∈ 𝐴))
71, 3, 63syl 17 . . . 4 ((𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → (𝑥 = ∅ → ∅ ∈ 𝐴))
87alimi 1443 . . 3 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∀𝑥(𝑥 = ∅ → ∅ ∈ 𝐴))
9 exim 1587 . . 3 (∀𝑥(𝑥 = ∅ → ∅ ∈ 𝐴) → (∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴))
10 0ex 4109 . . . . . 6 ∅ ∈ V
1110isseti 2734 . . . . 5 𝑥 𝑥 = ∅
12 pm2.27 40 . . . . 5 (∃𝑥 𝑥 = ∅ → ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∃𝑥∅ ∈ 𝐴))
1311, 12ax-mp 5 . . . 4 ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∃𝑥∅ ∈ 𝐴)
14 bj-ex 13643 . . . 4 (∃𝑥∅ ∈ 𝐴 → ∅ ∈ 𝐴)
1513, 14syl 14 . . 3 ((∃𝑥 𝑥 = ∅ → ∃𝑥∅ ∈ 𝐴) → ∅ ∈ 𝐴)
168, 9, 153syl 17 . 2 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∅ ∈ 𝐴)
173simprd 113 . . . . . 6 (((𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦) → 𝑥𝐴) → (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴))
181, 17syl 14 . . . . 5 ((𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → (∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴))
1918alimi 1443 . . . 4 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∀𝑥(∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴))
20 eqid 2165 . . . . 5 suc 𝑧 = suc 𝑧
21 suceq 4380 . . . . . . 7 (𝑦 = 𝑧 → suc 𝑦 = suc 𝑧)
2221eqeq2d 2177 . . . . . 6 (𝑦 = 𝑧 → (suc 𝑧 = suc 𝑦 ↔ suc 𝑧 = suc 𝑧))
2322rspcev 2830 . . . . 5 ((𝑧𝐴 ∧ suc 𝑧 = suc 𝑧) → ∃𝑦𝐴 suc 𝑧 = suc 𝑦)
2420, 23mpan2 422 . . . 4 (𝑧𝐴 → ∃𝑦𝐴 suc 𝑧 = suc 𝑦)
25 vex 2729 . . . . . 6 𝑧 ∈ V
2625bj-sucex 13805 . . . . 5 suc 𝑧 ∈ V
27 eqeq1 2172 . . . . . . 7 (𝑥 = suc 𝑧 → (𝑥 = suc 𝑦 ↔ suc 𝑧 = suc 𝑦))
2827rexbidv 2467 . . . . . 6 (𝑥 = suc 𝑧 → (∃𝑦𝐴 𝑥 = suc 𝑦 ↔ ∃𝑦𝐴 suc 𝑧 = suc 𝑦))
29 eleq1 2229 . . . . . 6 (𝑥 = suc 𝑧 → (𝑥𝐴 ↔ suc 𝑧𝐴))
3028, 29imbi12d 233 . . . . 5 (𝑥 = suc 𝑧 → ((∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴) ↔ (∃𝑦𝐴 suc 𝑧 = suc 𝑦 → suc 𝑧𝐴)))
3126, 30spcv 2820 . . . 4 (∀𝑥(∃𝑦𝐴 𝑥 = suc 𝑦𝑥𝐴) → (∃𝑦𝐴 suc 𝑧 = suc 𝑦 → suc 𝑧𝐴))
3219, 24, 31syl2im 38 . . 3 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → (𝑧𝐴 → suc 𝑧𝐴))
3332ralrimiv 2538 . 2 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → ∀𝑧𝐴 suc 𝑧𝐴)
34 df-bj-ind 13809 . 2 (Ind 𝐴 ↔ (∅ ∈ 𝐴 ∧ ∀𝑧𝐴 suc 𝑧𝐴))
3516, 33, 34sylanbrc 414 1 (∀𝑥(𝑥𝐴 ↔ (𝑥 = ∅ ∨ ∃𝑦𝐴 𝑥 = suc 𝑦)) → Ind 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wo 698  wal 1341   = wceq 1343  wex 1480  wcel 2136  wral 2444  wrex 2445  c0 3409  suc csuc 4343  Ind wind 13808
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-nul 4108  ax-pr 4187  ax-un 4411  ax-bd0 13695  ax-bdor 13698  ax-bdex 13701  ax-bdeq 13702  ax-bdel 13703  ax-bdsb 13704  ax-bdsep 13766
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-dif 3118  df-un 3120  df-nul 3410  df-sn 3582  df-pr 3583  df-uni 3790  df-suc 4349  df-bdc 13723  df-bj-ind 13809
This theorem is referenced by:  bj-inf2vn  13856  bj-inf2vn2  13857
  Copyright terms: Public domain W3C validator