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

Theorem onaddscl 28269
Description: The surreal ordinals are closed under addition. (Contributed by Scott Fenton, 22-Aug-2025.)
Assertion
Ref Expression
onaddscl ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 +s 𝐵) ∈ Ons)

Proof of Theorem onaddscl
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6853 . . . . 5 ( L ‘𝐴) ∈ V
21abrexex 7915 . . . 4 {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∈ V
3 fvex 6853 . . . . 5 ( L ‘𝐵) ∈ V
43abrexex 7915 . . . 4 {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)} ∈ V
52, 4unex 7698 . . 3 ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ∈ V
65a1i 11 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ∈ V)
7 leftno 27869 . . . . . . . 8 (𝑦 ∈ ( L ‘𝐴) → 𝑦 No )
87adantl 481 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → 𝑦 No )
9 onno 28247 . . . . . . . 8 (𝐵 ∈ Ons𝐵 No )
109ad2antlr 728 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → 𝐵 No )
118, 10addscld 27972 . . . . . 6 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → (𝑦 +s 𝐵) ∈ No )
12 eleq1 2824 . . . . . 6 (𝑥 = (𝑦 +s 𝐵) → (𝑥 No ↔ (𝑦 +s 𝐵) ∈ No ))
1311, 12syl5ibrcom 247 . . . . 5 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → (𝑥 = (𝑦 +s 𝐵) → 𝑥 No ))
1413rexlimdva 3138 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵) → 𝑥 No ))
1514abssdv 4007 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ⊆ No )
16 onno 28247 . . . . . . . 8 (𝐴 ∈ Ons𝐴 No )
1716ad2antrr 727 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → 𝐴 No )
18 leftno 27869 . . . . . . . 8 (𝑦 ∈ ( L ‘𝐵) → 𝑦 No )
1918adantl 481 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → 𝑦 No )
2017, 19addscld 27972 . . . . . 6 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → (𝐴 +s 𝑦) ∈ No )
21 eleq1 2824 . . . . . 6 (𝑥 = (𝐴 +s 𝑦) → (𝑥 No ↔ (𝐴 +s 𝑦) ∈ No ))
2220, 21syl5ibrcom 247 . . . . 5 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → (𝑥 = (𝐴 +s 𝑦) → 𝑥 No ))
2322rexlimdva 3138 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦) → 𝑥 No ))
2423abssdv 4007 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)} ⊆ No )
2515, 24unssd 4132 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ⊆ No )
26 leftssno 27865 . . . . . 6 ( L ‘𝐴) ⊆ No
271elpw 4545 . . . . . 6 (( L ‘𝐴) ∈ 𝒫 No ↔ ( L ‘𝐴) ⊆ No )
2826, 27mpbir 231 . . . . 5 ( L ‘𝐴) ∈ 𝒫 No
29 nulsgts 27768 . . . . 5 (( L ‘𝐴) ∈ 𝒫 No → ( L ‘𝐴) <<s ∅)
3028, 29mp1i 13 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ( L ‘𝐴) <<s ∅)
31 leftssno 27865 . . . . . 6 ( L ‘𝐵) ⊆ No
323elpw 4545 . . . . . 6 (( L ‘𝐵) ∈ 𝒫 No ↔ ( L ‘𝐵) ⊆ No )
3331, 32mpbir 231 . . . . 5 ( L ‘𝐵) ∈ 𝒫 No
34 nulsgts 27768 . . . . 5 (( L ‘𝐵) ∈ 𝒫 No → ( L ‘𝐵) <<s ∅)
3533, 34mp1i 13 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ( L ‘𝐵) <<s ∅)
36 oncutleft 28255 . . . . 5 (𝐴 ∈ Ons𝐴 = (( L ‘𝐴) |s ∅))
3736adantr 480 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐴 = (( L ‘𝐴) |s ∅))
38 oncutleft 28255 . . . . 5 (𝐵 ∈ Ons𝐵 = (( L ‘𝐵) |s ∅))
3938adantl 481 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐵 = (( L ‘𝐵) |s ∅))
4030, 35, 37, 39addsunif 27994 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 +s 𝐵) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)})))
41 rex0 4300 . . . . . . 7 ¬ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)
4241abf 4346 . . . . . 6 {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} = ∅
43 rex0 4300 . . . . . . 7 ¬ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)
4443abf 4346 . . . . . 6 {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)} = ∅
4542, 44uneq12i 4106 . . . . 5 ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)}) = (∅ ∪ ∅)
46 un0 4334 . . . . 5 (∅ ∪ ∅) = ∅
4745, 46eqtri 2759 . . . 4 ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)}) = ∅
4847oveq2i 7378 . . 3 (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)})) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ∅)
4940, 48eqtrdi 2787 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 +s 𝐵) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ∅))
506, 25, 49elons2d 28251 1 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 +s 𝐵) ∈ Ons)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2714  wrex 3061  Vcvv 3429  cun 3887  wss 3889  c0 4273  𝒫 cpw 4541   class class class wbr 5085  cfv 6498  (class class class)co 7367   No csur 27603   <<s cslts 27749   |s ccuts 27751   L cleft 27817   +s cadds 27951  Onscons 28243
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-ot 4576  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-1o 8405  df-2o 8406  df-nadd 8602  df-no 27606  df-lts 27607  df-bday 27608  df-les 27709  df-slts 27750  df-cuts 27752  df-0s 27799  df-made 27819  df-old 27820  df-left 27822  df-right 27823  df-norec2 27941  df-adds 27952  df-ons 28244
This theorem is referenced by:  addonbday  28271  peano2ons  28272
  Copyright terms: Public domain W3C validator