Theorem onaddscl 28542

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.

Step	Hyp	Ref	Expression
1		fvex 6891	. . . . 5 ⊢ ( L ‘𝐴) ∈ V
2	1	abrexex 7959	. . . 4 ⊢ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∈ V
3		fvex 6891	. . . . 5 ⊢ ( L ‘𝐵) ∈ V
4	3	abrexex 7959	. . . 4 ⊢ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)} ∈ V
5	2, 4	unex 7746	. . 3 ⊢ ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ∈ V
6	5	a1i 11	. 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ∈ V)
7		leftno 28142	. . . . . . . 8 ⊢ (𝑦 ∈ ( L ‘𝐴) → 𝑦 ∈ No )
8	7	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → 𝑦 ∈ No )
9		onno 28520	. . . . . . . 8 ⊢ (𝐵 ∈ Ons → 𝐵 ∈ No )
10	9	ad2antlr 740	. . . . . . 7 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → 𝐵 ∈ No )
11	8, 10	addscld 28245	. . . . . 6 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → (𝑦 +s 𝐵) ∈ No )
12		eleq1 2848	. . . . . 6 ⊢ (𝑥 = (𝑦 +s 𝐵) → (𝑥 ∈ No ↔ (𝑦 +s 𝐵) ∈ No ))
13	11, 12	syl5ibrcom 250	. . . . 5 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐴)) → (𝑥 = (𝑦 +s 𝐵) → 𝑥 ∈ No ))
14	13	rexlimdva 3163	. . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵) → 𝑥 ∈ No ))
15	14	abssdv 4015	. . 3 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ⊆ No )
16		onno 28520	. . . . . . . 8 ⊢ (𝐴 ∈ Ons → 𝐴 ∈ No )
17	16	ad2antrr 739	. . . . . . 7 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → 𝐴 ∈ No )
18		leftno 28142	. . . . . . . 8 ⊢ (𝑦 ∈ ( L ‘𝐵) → 𝑦 ∈ No )
19	18	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → 𝑦 ∈ No )
20	17, 19	addscld 28245	. . . . . 6 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → (𝐴 +s 𝑦) ∈ No )
21		eleq1 2848	. . . . . 6 ⊢ (𝑥 = (𝐴 +s 𝑦) → (𝑥 ∈ No ↔ (𝐴 +s 𝑦) ∈ No ))
22	20, 21	syl5ibrcom 250	. . . . 5 ⊢ (((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) ∧ 𝑦 ∈ ( L ‘𝐵)) → (𝑥 = (𝐴 +s 𝑦) → 𝑥 ∈ No ))
23	22	rexlimdva 3163	. . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦) → 𝑥 ∈ No ))
24	23	abssdv 4015	. . 3 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)} ⊆ No )
25	15, 24	unssd 4138	. 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) ⊆ No )
26		leftssno 28138	. . . . . 6 ⊢ ( L ‘𝐴) ⊆ No
27	1	elpw 4561	. . . . . 6 ⊢ (( L ‘𝐴) ∈ 𝒫 No ↔ ( L ‘𝐴) ⊆ No )
28	26, 27	mpbir 234	. . . . 5 ⊢ ( L ‘𝐴) ∈ 𝒫 No
29		nulsgts 28041	. . . . 5 ⊢ (( L ‘𝐴) ∈ 𝒫 No → ( L ‘𝐴) <<s ∅)
30	28, 29	mp1i 14	. . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → ( L ‘𝐴) <<s ∅)
31		leftssno 28138	. . . . . 6 ⊢ ( L ‘𝐵) ⊆ No
32	3	elpw 4561	. . . . . 6 ⊢ (( L ‘𝐵) ∈ 𝒫 No ↔ ( L ‘𝐵) ⊆ No )
33	31, 32	mpbir 234	. . . . 5 ⊢ ( L ‘𝐵) ∈ 𝒫 No
34		nulsgts 28041	. . . . 5 ⊢ (( L ‘𝐵) ∈ 𝒫 No → ( L ‘𝐵) <<s ∅)
35	33, 34	mp1i 14	. . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → ( L ‘𝐵) <<s ∅)
36		oncutleft 28528	. . . . 5 ⊢ (𝐴 ∈ Ons → 𝐴 = (( L ‘𝐴) |s ∅))
37	36	adantr 486	. . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → 𝐴 = (( L ‘𝐴) |s ∅))
38		oncutleft 28528	. . . . 5 ⊢ (𝐵 ∈ Ons → 𝐵 = (( L ‘𝐵) |s ∅))
39	38	adantl 487	. . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → 𝐵 = (( L ‘𝐵) |s ∅))
40	30, 35, 37, 39	addsunif 28267	. . 3 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 +s 𝐵) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)})))
41		rex0 4308	. . . . . . 7 ⊢ ¬ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)
42	41	abf 4364	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} = ∅
43		rex0 4308	. . . . . . 7 ⊢ ¬ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)
44	43	abf 4364	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)} = ∅
45	42, 44	uneq12i 4113	. . . . 5 ⊢ ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)}) = (∅ ∪ ∅)
46		un0 4344	. . . . 5 ⊢ (∅ ∪ ∅) = ∅
47	45, 46	eqtri 2783	. . . 4 ⊢ ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)}) = ∅
48	47	oveq2i 7424	. . 3 ⊢ (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ 𝑥 = (𝐴 +s 𝑦)})) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ∅)
49	40, 48	eqtrdi 2811	. 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 +s 𝐵) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)𝑥 = (𝑦 +s 𝐵)} ∪ {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐵)𝑥 = (𝐴 +s 𝑦)}) |s ∅))
50	6, 25, 49	elons2d 28524	1 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 +s 𝐵) ∈ Ons)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  ∃wrex 3086  Vcvv 3450   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557   class class class wbr 5103  ‘cfv 6533  (class class class)co 7413   No csur 27876   <<s cslts 28022   |s ccuts 28024   L cleft 28090   +_s cadds 28224  On_scons 28516

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-1o 8455  df-2o 8456  df-nadd 8654  df-no 27879  df-lts 27880  df-bday 27881  df-les 27981  df-slts 28023  df-cuts 28025  df-0s 28072  df-made 28092  df-old 28093  df-left 28095  df-right 28096  df-norec2 28214  df-adds 28225  df-ons 28517

This theorem is used by:  addonbday  28544  peano2ons  28545