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

Theorem nnsucsssuc 6659
Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucsssucr 4607, but the forward direction, for all ordinals, implies excluded middle as seen as onsucsssucexmid 4625. (Contributed by Jim Kingdon, 25-Aug-2019.)
Assertion
Ref Expression
nnsucsssuc ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))

Proof of Theorem nnsucsssuc
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sseq1 3250 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐵𝐴𝐵))
2 suceq 4499 . . . . . . 7 (𝑥 = 𝐴 → suc 𝑥 = suc 𝐴)
32sseq1d 3256 . . . . . 6 (𝑥 = 𝐴 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
41, 3imbi12d 234 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
54imbi2d 230 . . . 4 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)) ↔ (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))))
6 sseq1 3250 . . . . . 6 (𝑥 = ∅ → (𝑥𝐵 ↔ ∅ ⊆ 𝐵))
7 suceq 4499 . . . . . . 7 (𝑥 = ∅ → suc 𝑥 = suc ∅)
87sseq1d 3256 . . . . . 6 (𝑥 = ∅ → (suc 𝑥 ⊆ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
96, 8imbi12d 234 . . . . 5 (𝑥 = ∅ → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (∅ ⊆ 𝐵 → suc ∅ ⊆ suc 𝐵)))
10 sseq1 3250 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐵𝑦𝐵))
11 suceq 4499 . . . . . . 7 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
1211sseq1d 3256 . . . . . 6 (𝑥 = 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝑦 ⊆ suc 𝐵))
1310, 12imbi12d 234 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)))
14 sseq1 3250 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝐵 ↔ suc 𝑦𝐵))
15 suceq 4499 . . . . . . 7 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1615sseq1d 3256 . . . . . 6 (𝑥 = suc 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
1714, 16imbi12d 234 . . . . 5 (𝑥 = suc 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵)))
18 peano3 4694 . . . . . . . . 9 (𝐵 ∈ ω → suc 𝐵 ≠ ∅)
1918neneqd 2423 . . . . . . . 8 (𝐵 ∈ ω → ¬ suc 𝐵 = ∅)
20 peano2 4693 . . . . . . . . . 10 (𝐵 ∈ ω → suc 𝐵 ∈ ω)
21 0elnn 4717 . . . . . . . . . 10 (suc 𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2220, 21syl 14 . . . . . . . . 9 (𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2322ord 731 . . . . . . . 8 (𝐵 ∈ ω → (¬ suc 𝐵 = ∅ → ∅ ∈ suc 𝐵))
2419, 23mpd 13 . . . . . . 7 (𝐵 ∈ ω → ∅ ∈ suc 𝐵)
25 nnord 4710 . . . . . . . 8 (𝐵 ∈ ω → Ord 𝐵)
26 ordsucim 4598 . . . . . . . 8 (Ord 𝐵 → Ord suc 𝐵)
27 0ex 4216 . . . . . . . . 9 ∅ ∈ V
28 ordelsuc 4603 . . . . . . . . 9 ((∅ ∈ V ∧ Ord suc 𝐵) → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
2927, 28mpan 424 . . . . . . . 8 (Ord suc 𝐵 → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
3025, 26, 293syl 17 . . . . . . 7 (𝐵 ∈ ω → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
3124, 30mpbid 147 . . . . . 6 (𝐵 ∈ ω → suc ∅ ⊆ suc 𝐵)
3231a1d 22 . . . . 5 (𝐵 ∈ ω → (∅ ⊆ 𝐵 → suc ∅ ⊆ suc 𝐵))
33 simp3 1025 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦𝐵)
34 simp1l 1047 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦 ∈ ω)
35 simp1r 1048 . . . . . . . . . . . 12 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝐵 ∈ ω)
3635, 25syl 14 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord 𝐵)
37 ordelsuc 4603 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ Ord 𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3834, 36, 37syl2anc 411 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3933, 38mpbird 167 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦𝐵)
40 nnsucelsuc 6658 . . . . . . . . . 10 (𝐵 ∈ ω → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4135, 40syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4239, 41mpbid 147 . . . . . . . 8 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ suc 𝐵)
43 peano2 4693 . . . . . . . . . 10 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
4434, 43syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ ω)
4536, 26syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord suc 𝐵)
46 ordelsuc 4603 . . . . . . . . 9 ((suc 𝑦 ∈ ω ∧ Ord suc 𝐵) → (suc 𝑦 ∈ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
4744, 45, 46syl2anc 411 . . . . . . . 8 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (suc 𝑦 ∈ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
4842, 47mpbid 147 . . . . . . 7 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc suc 𝑦 ⊆ suc 𝐵)
49483expia 1231 . . . . . 6 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))
5049exp31 364 . . . . 5 (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))))
519, 13, 17, 32, 50finds2 4699 . . . 4 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)))
525, 51vtoclga 2870 . . 3 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
5352imp 124 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))
54 nnon 4708 . . 3 (𝐴 ∈ ω → 𝐴 ∈ On)
55 onsucsssucr 4607 . . 3 ((𝐴 ∈ On ∧ Ord 𝐵) → (suc 𝐴 ⊆ suc 𝐵𝐴𝐵))
5654, 25, 55syl2an 289 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ⊆ suc 𝐵𝐴𝐵))
5753, 56impbid 129 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 715  w3a 1004   = wceq 1397  wcel 2202  Vcvv 2802  wss 3200  c0 3494  Ord word 4459  Oncon0 4460  suc csuc 4462  ωcom 4688
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-uni 3894  df-int 3929  df-tr 4188  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689
This theorem is referenced by:  nnaword  6678  ennnfonelemk  13020  ennnfonelemkh  13032
  Copyright terms: Public domain W3C validator