MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eldifsucnn Structured version   Visualization version   GIF version

Theorem eldifsucnn 8594
Description: Condition for membership in the difference of ω and a nonzero finite ordinal. (Contributed by Scott Fenton, 24-Oct-2024.)
Assertion
Ref Expression
eldifsucnn (𝐴 ∈ ω → (𝐵 ∈ (ω ∖ suc 𝐴) ↔ ∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem eldifsucnn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 peano2 7834 . . . . . 6 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 nnawordex 8567 . . . . . 6 ((suc 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴𝐵 ↔ ∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵))
31, 2sylan 587 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴𝐵 ↔ ∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵))
4 nnacl 8541 . . . . . . . . 9 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o 𝑦) ∈ ω)
5 nnaword1 8559 . . . . . . . . 9 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → 𝐴 ⊆ (𝐴 +o 𝑦))
6 nnasuc 8536 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → (𝑦 +o suc 𝐴) = suc (𝑦 +o 𝐴))
76ancoms 460 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝑦 +o suc 𝐴) = suc (𝑦 +o 𝐴))
8 nnacom 8547 . . . . . . . . . . 11 ((suc 𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (suc 𝐴 +o 𝑦) = (𝑦 +o suc 𝐴))
91, 8sylan 587 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (suc 𝐴 +o 𝑦) = (𝑦 +o suc 𝐴))
10 nnacom 8547 . . . . . . . . . . 11 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o 𝑦) = (𝑦 +o 𝐴))
11 suceq 6382 . . . . . . . . . . 11 ((𝐴 +o 𝑦) = (𝑦 +o 𝐴) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
1210, 11syl 17 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
137, 9, 123eqtr4d 2786 . . . . . . . . 9 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦))
14 sseq2 3943 . . . . . . . . . . 11 (𝑥 = (𝐴 +o 𝑦) → (𝐴𝑥𝐴 ⊆ (𝐴 +o 𝑦)))
15 suceq 6382 . . . . . . . . . . . 12 (𝑥 = (𝐴 +o 𝑦) → suc 𝑥 = suc (𝐴 +o 𝑦))
1615eqeq2d 2752 . . . . . . . . . . 11 (𝑥 = (𝐴 +o 𝑦) → ((suc 𝐴 +o 𝑦) = suc 𝑥 ↔ (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦)))
1714, 16anbi12d 639 . . . . . . . . . 10 (𝑥 = (𝐴 +o 𝑦) → ((𝐴𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥) ↔ (𝐴 ⊆ (𝐴 +o 𝑦) ∧ (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦))))
1817rspcev 3562 . . . . . . . . 9 (((𝐴 +o 𝑦) ∈ ω ∧ (𝐴 ⊆ (𝐴 +o 𝑦) ∧ (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦))) → ∃𝑥 ∈ ω (𝐴𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥))
194, 5, 13, 18syl12anc 843 . . . . . . . 8 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ∃𝑥 ∈ ω (𝐴𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥))
20 eqeq1 2745 . . . . . . . . . 10 ((suc 𝐴 +o 𝑦) = 𝐵 → ((suc 𝐴 +o 𝑦) = suc 𝑥𝐵 = suc 𝑥))
2120anbi2d 637 . . . . . . . . 9 ((suc 𝐴 +o 𝑦) = 𝐵 → ((𝐴𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥) ↔ (𝐴𝑥𝐵 = suc 𝑥)))
2221rexbidv 3165 . . . . . . . 8 ((suc 𝐴 +o 𝑦) = 𝐵 → (∃𝑥 ∈ ω (𝐴𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥) ↔ ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
2319, 22syl5ibcom 247 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((suc 𝐴 +o 𝑦) = 𝐵 → ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
2423rexlimdva 3142 . . . . . 6 (𝐴 ∈ ω → (∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵 → ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
2524adantr 482 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵 → ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
263, 25sylbid 242 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴𝐵 → ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
2726expimpd 455 . . 3 (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ suc 𝐴𝐵) → ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
28 peano2 7834 . . . . . . . 8 (𝑥 ∈ ω → suc 𝑥 ∈ ω)
2928ad2antlr 734 . . . . . . 7 (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴𝑥) → suc 𝑥 ∈ ω)
30 nnord 7818 . . . . . . . . 9 (𝐴 ∈ ω → Ord 𝐴)
31 nnord 7818 . . . . . . . . 9 (𝑥 ∈ ω → Ord 𝑥)
32 ordsucsssuc 7767 . . . . . . . . 9 ((Ord 𝐴 ∧ Ord 𝑥) → (𝐴𝑥 ↔ suc 𝐴 ⊆ suc 𝑥))
3330, 31, 32syl2an 603 . . . . . . . 8 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴𝑥 ↔ suc 𝐴 ⊆ suc 𝑥))
3433biimpa 478 . . . . . . 7 (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴𝑥) → suc 𝐴 ⊆ suc 𝑥)
3529, 34jca 517 . . . . . 6 (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴𝑥) → (suc 𝑥 ∈ ω ∧ suc 𝐴 ⊆ suc 𝑥))
36 eleq1 2829 . . . . . . 7 (𝐵 = suc 𝑥 → (𝐵 ∈ ω ↔ suc 𝑥 ∈ ω))
37 sseq2 3943 . . . . . . 7 (𝐵 = suc 𝑥 → (suc 𝐴𝐵 ↔ suc 𝐴 ⊆ suc 𝑥))
3836, 37anbi12d 639 . . . . . 6 (𝐵 = suc 𝑥 → ((𝐵 ∈ ω ∧ suc 𝐴𝐵) ↔ (suc 𝑥 ∈ ω ∧ suc 𝐴 ⊆ suc 𝑥)))
3935, 38syl5ibrcom 249 . . . . 5 (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴𝑥) → (𝐵 = suc 𝑥 → (𝐵 ∈ ω ∧ suc 𝐴𝐵)))
4039expimpd 455 . . . 4 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ((𝐴𝑥𝐵 = suc 𝑥) → (𝐵 ∈ ω ∧ suc 𝐴𝐵)))
4140rexlimdva 3142 . . 3 (𝐴 ∈ ω → (∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥) → (𝐵 ∈ ω ∧ suc 𝐴𝐵)))
4227, 41impbid 214 . 2 (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ suc 𝐴𝐵) ↔ ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
43 eldif 3895 . . 3 (𝐵 ∈ (ω ∖ suc 𝐴) ↔ (𝐵 ∈ ω ∧ ¬ 𝐵 ∈ suc 𝐴))
44 nnord 7818 . . . . . 6 (suc 𝐴 ∈ ω → Ord suc 𝐴)
451, 44syl 17 . . . . 5 (𝐴 ∈ ω → Ord suc 𝐴)
46 nnord 7818 . . . . 5 (𝐵 ∈ ω → Ord 𝐵)
47 ordtri1 6347 . . . . 5 ((Ord suc 𝐴 ∧ Ord 𝐵) → (suc 𝐴𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴))
4845, 46, 47syl2an 603 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴))
4948pm5.32da 585 . . 3 (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ suc 𝐴𝐵) ↔ (𝐵 ∈ ω ∧ ¬ 𝐵 ∈ suc 𝐴)))
5043, 49bitr4id 292 . 2 (𝐴 ∈ ω → (𝐵 ∈ (ω ∖ suc 𝐴) ↔ (𝐵 ∈ ω ∧ suc 𝐴𝐵)))
51 eldif 3895 . . . . . 6 (𝑥 ∈ (ω ∖ 𝐴) ↔ (𝑥 ∈ ω ∧ ¬ 𝑥𝐴))
5251anbi1i 631 . . . . 5 ((𝑥 ∈ (ω ∖ 𝐴) ∧ 𝐵 = suc 𝑥) ↔ ((𝑥 ∈ ω ∧ ¬ 𝑥𝐴) ∧ 𝐵 = suc 𝑥))
53 anass 470 . . . . 5 (((𝑥 ∈ ω ∧ ¬ 𝑥𝐴) ∧ 𝐵 = suc 𝑥) ↔ (𝑥 ∈ ω ∧ (¬ 𝑥𝐴𝐵 = suc 𝑥)))
5452, 53bitri 277 . . . 4 ((𝑥 ∈ (ω ∖ 𝐴) ∧ 𝐵 = suc 𝑥) ↔ (𝑥 ∈ ω ∧ (¬ 𝑥𝐴𝐵 = suc 𝑥)))
5554rexbii2 3084 . . 3 (∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥 ↔ ∃𝑥 ∈ ω (¬ 𝑥𝐴𝐵 = suc 𝑥))
56 ordtri1 6347 . . . . . 6 ((Ord 𝐴 ∧ Ord 𝑥) → (𝐴𝑥 ↔ ¬ 𝑥𝐴))
5730, 31, 56syl2an 603 . . . . 5 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴𝑥 ↔ ¬ 𝑥𝐴))
5857anbi1d 638 . . . 4 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ((𝐴𝑥𝐵 = suc 𝑥) ↔ (¬ 𝑥𝐴𝐵 = suc 𝑥)))
5958rexbidva 3163 . . 3 (𝐴 ∈ ω → (∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥) ↔ ∃𝑥 ∈ ω (¬ 𝑥𝐴𝐵 = suc 𝑥)))
6055, 59bitr4id 292 . 2 (𝐴 ∈ ω → (∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥 ↔ ∃𝑥 ∈ ω (𝐴𝑥𝐵 = suc 𝑥)))
6142, 50, 603bitr4d 313 1 (𝐴 ∈ ω → (𝐵 ∈ (ω ∖ suc 𝐴) ↔ ∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  wrex 3065  cdif 3882  wss 3885  Ord word 6313  suc csuc 6316  (class class class)co 7360  ωcom 7810   +o coa 8396
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-int 4881  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-oadd 8403
This theorem is referenced by:  brttrcl2  9630  ttrcltr  9632  rnttrcl  9638
  Copyright terms: Public domain W3C validator