Theorem addsproplem5 28246

Description: Lemma for surreal addition properties. Show the second half of the inductive hypothesis when 𝑍 is older than 𝑌. (Contributed by Scott Fenton, 21-Jan-2025.)

Hypotheses

Ref	Expression
addsproplem.1	⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
addspropord.2	⊢ (𝜑 → 𝑋 ∈ No )
addspropord.3	⊢ (𝜑 → 𝑌 ∈ No )
addspropord.4	⊢ (𝜑 → 𝑍 ∈ No )
addspropord.5	⊢ (𝜑 → 𝑌 <s 𝑍)
addsproplem5.6	⊢ (𝜑 → ( bday ‘𝑍) ∈ ( bday ‘𝑌))

Assertion

Ref	Expression
addsproplem5	⊢ (𝜑 → (𝑌 +s 𝑋) <s (𝑍 +s 𝑋))

Distinct variable groups:   𝑥,𝑋,𝑦,𝑧   𝑥,𝑌,𝑦,𝑧   𝑥,𝑍,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)

Proof of Theorem addsproplem5

Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addsproplem.1	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
2		addspropord.2	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ No )
3		addspropord.3	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ No )
4	1, 2, 3	addsproplem3 28244	. . . 4 ⊢ (𝜑 → ((𝑋 +s 𝑌) ∈ No ∧ ({𝑒 ∣ ∃𝑓 ∈ ( L ‘𝑋)𝑒 = (𝑓 +s 𝑌)} ∪ {𝑔 ∣ ∃ℎ ∈ ( L ‘𝑌)𝑔 = (𝑋 +s ℎ)}) <<s {(𝑋 +s 𝑌)} ∧ {(𝑋 +s 𝑌)} <<s ({𝑎 ∣ ∃𝑐 ∈ ( R ‘𝑋)𝑎 = (𝑐 +s 𝑌)} ∪ {𝑏 ∣ ∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑)})))
5	4	simp3d 1162	. . 3 ⊢ (𝜑 → {(𝑋 +s 𝑌)} <<s ({𝑎 ∣ ∃𝑐 ∈ ( R ‘𝑋)𝑎 = (𝑐 +s 𝑌)} ∪ {𝑏 ∣ ∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑)}))
6		ovex 7450	. . . . 5 ⊢ (𝑋 +s 𝑌) ∈ V
7	6	snid 4626	. . . 4 ⊢ (𝑋 +s 𝑌) ∈ {(𝑋 +s 𝑌)}
8	7	a1i 11	. . 3 ⊢ (𝜑 → (𝑋 +s 𝑌) ∈ {(𝑋 +s 𝑌)})
9		addsproplem5.6	. . . . . . . 8 ⊢ (𝜑 → ( bday ‘𝑍) ∈ ( bday ‘𝑌))
10		bdayon 28025	. . . . . . . . 9 ⊢ ( bday ‘𝑌) ∈ On
11		addspropord.4	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ∈ No )
12		oldbday 28174	. . . . . . . . 9 ⊢ ((( bday ‘𝑌) ∈ On ∧ 𝑍 ∈ No ) → (𝑍 ∈ ( O ‘( bday ‘𝑌)) ↔ ( bday ‘𝑍) ∈ ( bday ‘𝑌)))
13	10, 11, 12	sylancr 599	. . . . . . . 8 ⊢ (𝜑 → (𝑍 ∈ ( O ‘( bday ‘𝑌)) ↔ ( bday ‘𝑍) ∈ ( bday ‘𝑌)))
14	9, 13	mpbird 260	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ ( O ‘( bday ‘𝑌)))
15		addspropord.5	. . . . . . 7 ⊢ (𝜑 → 𝑌 <s 𝑍)
16		elright 28125	. . . . . . 7 ⊢ (𝑍 ∈ ( R ‘𝑌) ↔ (𝑍 ∈ ( O ‘( bday ‘𝑌)) ∧ 𝑌 <s 𝑍))
17	14, 15, 16	sylanbrc 595	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ ( R ‘𝑌))
18		eqid 2762	. . . . . 6 ⊢ (𝑋 +s 𝑍) = (𝑋 +s 𝑍)
19		oveq2 7425	. . . . . . 7 ⊢ (𝑑 = 𝑍 → (𝑋 +s 𝑑) = (𝑋 +s 𝑍))
20	19	rspceeqv 3602	. . . . . 6 ⊢ ((𝑍 ∈ ( R ‘𝑌) ∧ (𝑋 +s 𝑍) = (𝑋 +s 𝑍)) → ∃𝑑 ∈ ( R ‘𝑌)(𝑋 +s 𝑍) = (𝑋 +s 𝑑))
21	17, 18, 20	sylancl 598	. . . . 5 ⊢ (𝜑 → ∃𝑑 ∈ ( R ‘𝑌)(𝑋 +s 𝑍) = (𝑋 +s 𝑑))
22		ovex 7450	. . . . . 6 ⊢ (𝑋 +s 𝑍) ∈ V
23		eqeq1 2766	. . . . . . 7 ⊢ (𝑏 = (𝑋 +s 𝑍) → (𝑏 = (𝑋 +s 𝑑) ↔ (𝑋 +s 𝑍) = (𝑋 +s 𝑑)))
24	23	rexbidv 3188	. . . . . 6 ⊢ (𝑏 = (𝑋 +s 𝑍) → (∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑) ↔ ∃𝑑 ∈ ( R ‘𝑌)(𝑋 +s 𝑍) = (𝑋 +s 𝑑)))
25	22, 24	elab 3636	. . . . 5 ⊢ ((𝑋 +s 𝑍) ∈ {𝑏 ∣ ∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑)} ↔ ∃𝑑 ∈ ( R ‘𝑌)(𝑋 +s 𝑍) = (𝑋 +s 𝑑))
26	21, 25	sylibr 237	. . . 4 ⊢ (𝜑 → (𝑋 +s 𝑍) ∈ {𝑏 ∣ ∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑)})
27		elun2 4132	. . . 4 ⊢ ((𝑋 +s 𝑍) ∈ {𝑏 ∣ ∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑)} → (𝑋 +s 𝑍) ∈ ({𝑎 ∣ ∃𝑐 ∈ ( R ‘𝑋)𝑎 = (𝑐 +s 𝑌)} ∪ {𝑏 ∣ ∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑)}))
28	26, 27	syl 18	. . 3 ⊢ (𝜑 → (𝑋 +s 𝑍) ∈ ({𝑎 ∣ ∃𝑐 ∈ ( R ‘𝑋)𝑎 = (𝑐 +s 𝑌)} ∪ {𝑏 ∣ ∃𝑑 ∈ ( R ‘𝑌)𝑏 = (𝑋 +s 𝑑)}))
29	5, 8, 28	sltssepcd 28045	. 2 ⊢ (𝜑 → (𝑋 +s 𝑌) <s (𝑋 +s 𝑍))
30	3, 2	addscomd 28240	. 2 ⊢ (𝜑 → (𝑌 +s 𝑋) = (𝑋 +s 𝑌))
31	11, 2	addscomd 28240	. 2 ⊢ (𝜑 → (𝑍 +s 𝑋) = (𝑋 +s 𝑍))
32	29, 30, 31	3brtr4d 5141	1 ⊢ (𝜑 → (𝑌 +s 𝑋) <s (𝑍 +s 𝑋))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2740  ∀wral 3078  ∃wrex 3088   ∪ cun 3900  {csn 4587   class class class wbr 5107  Oncon0 6361  ‘cfv 6537  (class class class)co 7417   +no cnadd 8657   No csur 27884   <s clts 27885   bday cbday 27886   <<s cslts 28030   O cold 28096   L cleft 28098   R cright 28099   +_s cadds 28232

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-1o 8459  df-2o 8460  df-nadd 8658  df-no 27887  df-lts 27888  df-bday 27889  df-slts 28031  df-cuts 28033  df-0s 28080  df-made 28100  df-old 28101  df-left 28103  df-right 28104  df-norec2 28222  df-adds 28233

This theorem is used by:  addsproplem7  28248