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

Theorem nnsucsssuc 6471
Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucsssucr 4493, but the forward direction, for all ordinals, implies excluded middle as seen as onsucsssucexmid 4511. (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 3170 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐵𝐴𝐵))
2 suceq 4387 . . . . . . 7 (𝑥 = 𝐴 → suc 𝑥 = suc 𝐴)
32sseq1d 3176 . . . . . 6 (𝑥 = 𝐴 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
41, 3imbi12d 233 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
54imbi2d 229 . . . 4 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)) ↔ (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))))
6 sseq1 3170 . . . . . 6 (𝑥 = ∅ → (𝑥𝐵 ↔ ∅ ⊆ 𝐵))
7 suceq 4387 . . . . . . 7 (𝑥 = ∅ → suc 𝑥 = suc ∅)
87sseq1d 3176 . . . . . 6 (𝑥 = ∅ → (suc 𝑥 ⊆ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
96, 8imbi12d 233 . . . . 5 (𝑥 = ∅ → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (∅ ⊆ 𝐵 → suc ∅ ⊆ suc 𝐵)))
10 sseq1 3170 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐵𝑦𝐵))
11 suceq 4387 . . . . . . 7 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
1211sseq1d 3176 . . . . . 6 (𝑥 = 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝑦 ⊆ suc 𝐵))
1310, 12imbi12d 233 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)))
14 sseq1 3170 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝐵 ↔ suc 𝑦𝐵))
15 suceq 4387 . . . . . . 7 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1615sseq1d 3176 . . . . . 6 (𝑥 = suc 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
1714, 16imbi12d 233 . . . . 5 (𝑥 = suc 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵)))
18 peano3 4580 . . . . . . . . 9 (𝐵 ∈ ω → suc 𝐵 ≠ ∅)
1918neneqd 2361 . . . . . . . 8 (𝐵 ∈ ω → ¬ suc 𝐵 = ∅)
20 peano2 4579 . . . . . . . . . 10 (𝐵 ∈ ω → suc 𝐵 ∈ ω)
21 0elnn 4603 . . . . . . . . . 10 (suc 𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2220, 21syl 14 . . . . . . . . 9 (𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2322ord 719 . . . . . . . 8 (𝐵 ∈ ω → (¬ suc 𝐵 = ∅ → ∅ ∈ suc 𝐵))
2419, 23mpd 13 . . . . . . 7 (𝐵 ∈ ω → ∅ ∈ suc 𝐵)
25 nnord 4596 . . . . . . . 8 (𝐵 ∈ ω → Ord 𝐵)
26 ordsucim 4484 . . . . . . . 8 (Ord 𝐵 → Ord suc 𝐵)
27 0ex 4116 . . . . . . . . 9 ∅ ∈ V
28 ordelsuc 4489 . . . . . . . . 9 ((∅ ∈ V ∧ Ord suc 𝐵) → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
2927, 28mpan 422 . . . . . . . 8 (Ord suc 𝐵 → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
3025, 26, 293syl 17 . . . . . . 7 (𝐵 ∈ ω → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
3124, 30mpbid 146 . . . . . 6 (𝐵 ∈ ω → suc ∅ ⊆ suc 𝐵)
3231a1d 22 . . . . 5 (𝐵 ∈ ω → (∅ ⊆ 𝐵 → suc ∅ ⊆ suc 𝐵))
33 simp3 994 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦𝐵)
34 simp1l 1016 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦 ∈ ω)
35 simp1r 1017 . . . . . . . . . . . 12 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝐵 ∈ ω)
3635, 25syl 14 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord 𝐵)
37 ordelsuc 4489 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ Ord 𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3834, 36, 37syl2anc 409 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3933, 38mpbird 166 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦𝐵)
40 nnsucelsuc 6470 . . . . . . . . . 10 (𝐵 ∈ ω → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4135, 40syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4239, 41mpbid 146 . . . . . . . 8 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ suc 𝐵)
43 peano2 4579 . . . . . . . . . 10 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
4434, 43syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ ω)
4536, 26syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord suc 𝐵)
46 ordelsuc 4489 . . . . . . . . 9 ((suc 𝑦 ∈ ω ∧ Ord suc 𝐵) → (suc 𝑦 ∈ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
4744, 45, 46syl2anc 409 . . . . . . . 8 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (suc 𝑦 ∈ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
4842, 47mpbid 146 . . . . . . 7 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc suc 𝑦 ⊆ suc 𝐵)
49483expia 1200 . . . . . 6 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))
5049exp31 362 . . . . 5 (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))))
519, 13, 17, 32, 50finds2 4585 . . . 4 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)))
525, 51vtoclga 2796 . . 3 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
5352imp 123 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))
54 nnon 4594 . . 3 (𝐴 ∈ ω → 𝐴 ∈ On)
55 onsucsssucr 4493 . . 3 ((𝐴 ∈ On ∧ Ord 𝐵) → (suc 𝐴 ⊆ suc 𝐵𝐴𝐵))
5654, 25, 55syl2an 287 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ⊆ suc 𝐵𝐴𝐵))
5753, 56impbid 128 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wo 703  w3a 973   = wceq 1348  wcel 2141  Vcvv 2730  wss 3121  c0 3414  Ord word 4347  Oncon0 4348  suc csuc 4350  ωcom 4574
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-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-iinf 4572
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-uni 3797  df-int 3832  df-tr 4088  df-iord 4351  df-on 4353  df-suc 4356  df-iom 4575
This theorem is referenced by:  nnaword  6490  ennnfonelemk  12355  ennnfonelemkh  12367
  Copyright terms: Public domain W3C validator