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

Theorem onaddscl 28499
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 6898 . . . . 5 ( L ‘𝐴) ∈ V
21abrexex 7961 . . . 4 {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∈ V
3 fvex 6898 . . . . 5 ( L ‘𝐵) ∈ V
43abrexex 7961 . . . 4 {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)} ∈ V
52, 4unex 7748 . . 3 ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ∈ V
65a1i 11 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ∈ V)
7 leftno 28099 . . . . . . . 8 (𝑦 ∈ ( L ‘𝐴) → 𝑦 No )
87adantl 487 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → 𝑦 No )
9 onno 28477 . . . . . . . 8 (𝐵 ∈ Ons𝐵 No )
109ad2antlr 740 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → 𝐵 No )
118, 10addscld 28202 . . . . . 6 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → (𝑦 +s 𝐵) ∈ No )
12 eleq1 2853 . . . . . 6 (𝑥 = (𝑦 +s 𝐵) → (𝑥 No ↔ (𝑦 +s 𝐵) ∈ No ))
1311, 12syl5ibrcom 250 . . . . 5 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → (𝑥 = (𝑦 +s 𝐵) → 𝑥 No ))
1413rexlimdva 3168 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵) → 𝑥 No ))
1514abssdv 4022 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ⊆ No )
16 onno 28477 . . . . . . . 8 (𝐴 ∈ Ons𝐴 No )
1716ad2antrr 739 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → 𝐴 No )
18 leftno 28099 . . . . . . . 8 (𝑦 ∈ ( L ‘𝐵) → 𝑦 No )
1918adantl 487 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → 𝑦 No )
2017, 19addscld 28202 . . . . . 6 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → (𝐴 +s 𝑦) ∈ No )
21 eleq1 2853 . . . . . 6 (𝑥 = (𝐴 +s 𝑦) → (𝑥 No ↔ (𝐴 +s 𝑦) ∈ No ))
2220, 21syl5ibrcom 250 . . . . 5 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → (𝑥 = (𝐴 +s 𝑦) → 𝑥 No ))
2322rexlimdva 3168 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦) → 𝑥 No ))
2423abssdv 4022 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)} ⊆ No )
2515, 24unssd 4145 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ⊆ No )
26 leftssno 28095 . . . . . 6 ( L ‘𝐴) ⊆ No
271elpw 4568 . . . . . 6 (( L ‘𝐴) ∈ 𝒫 No ↔ ( L ‘𝐴) ⊆ No )
2826, 27mpbir 234 . . . . 5 ( L ‘𝐴) ∈ 𝒫 No
29 nulsgts 27998 . . . . 5 (( L ‘𝐴) ∈ 𝒫 No → ( L ‘𝐴) <<s ∅)
3028, 29mp1i 14 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ( L ‘𝐴) <<s ∅)
31 leftssno 28095 . . . . . 6 ( L ‘𝐵) ⊆ No
323elpw 4568 . . . . . 6 (( L ‘𝐵) ∈ 𝒫 No ↔ ( L ‘𝐵) ⊆ No )
3331, 32mpbir 234 . . . . 5 ( L ‘𝐵) ∈ 𝒫 No
34 nulsgts 27998 . . . . 5 (( L ‘𝐵) ∈ 𝒫 No → ( L ‘𝐵) <<s ∅)
3533, 34mp1i 14 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ( L ‘𝐵) <<s ∅)
36 oncutleft 28485 . . . . 5 (𝐴 ∈ Ons𝐴 = (( L ‘𝐴) |s ∅))
3736adantr 486 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐴 = (( L ‘𝐴) |s ∅))
38 oncutleft 28485 . . . . 5 (𝐵 ∈ Ons𝐵 = (( L ‘𝐵) |s ∅))
3938adantl 487 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐵 = (( L ‘𝐵) |s ∅))
4030, 35, 37, 39addsunif 28224 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 +s 𝐵) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)})))
41 rex0 4315 . . . . . . 7 ¬ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)
4241abf 4371 . . . . . 6 {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} = ∅
43 rex0 4315 . . . . . . 7 ¬ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)
4443abf 4371 . . . . . 6 {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)} = ∅
4542, 44uneq12i 4120 . . . . 5 ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)}) = (∅ ∪ ∅)
46 un0 4351 . . . . 5 (∅ ∪ ∅) = ∅
4745, 46eqtri 2788 . . . 4 ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)}) = ∅
4847oveq2i 7427 . . 3 (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)})) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ∅)
4940, 48eqtrdi 2816 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 +s 𝐵) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ∅))
506, 25, 49elons2d 28481 1 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 +s 𝐵) ∈ Ons)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  {cab 2743  wrex 3091  Vcvv 3457  cun 3904  wss 3906  c0 4286  𝒫 cpw 4564   class class class wbr 5111  cfv 6540  (class class class)co 7416   No csur 27833   <<s cslts 27979   |s ccuts 27981   L cleft 28047   +s cadds 28181  Onscons 28473
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-ot 4600  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-1o 8455  df-2o 8456  df-nadd 8654  df-no 27836  df-lts 27837  df-bday 27838  df-les 27938  df-slts 27980  df-cuts 27982  df-0s 28029  df-made 28049  df-old 28050  df-left 28052  df-right 28053  df-norec2 28171  df-adds 28182  df-ons 28474
This theorem is used by:  addonbday  28501  peano2ons  28502
  Copyright terms: Public domain W3C validator