Theorem addsproplem6 27966

Description: Lemma for surreal addition properties. Finally, we show the second half of the induction hypothesis when 𝑌 and 𝑍 are the same age. (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 𝑍)
addsproplem6.6	⊢ (𝜑 → ( bday ‘𝑌) = ( bday ‘𝑍))

Assertion

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

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

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

Proof of Theorem addsproplem6

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

Step	Hyp	Ref	Expression
1		addspropord.3	. . . 4 ⊢ (𝜑 → 𝑌 ∈ No )
2		addspropord.4	. . . 4 ⊢ (𝜑 → 𝑍 ∈ No )
3		addsproplem6.6	. . . 4 ⊢ (𝜑 → ( bday ‘𝑌) = ( bday ‘𝑍))
4		addspropord.5	. . . 4 ⊢ (𝜑 → 𝑌 <s 𝑍)
5		nodense 27656	. . . 4 ⊢ (((𝑌 ∈ No ∧ 𝑍 ∈ No ) ∧ (( bday ‘𝑌) = ( bday ‘𝑍) ∧ 𝑌 <s 𝑍)) → ∃𝑚 ∈ No (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))
6	1, 2, 3, 4, 5	syl22anc 839	. . 3 ⊢ (𝜑 → ∃𝑚 ∈ No (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))
7		addsproplem.1	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
8		addspropord.2	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ No )
9	7, 8, 1	addsproplem3 27963	. . . . . 6 ⊢ (𝜑 → ((𝑋 +s 𝑌) ∈ No ∧ ({𝑎 ∣ ∃𝑏 ∈ ( L ‘𝑋)𝑎 = (𝑏 +s 𝑌)} ∪ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑌)𝑐 = (𝑋 +s 𝑑)}) <<s {(𝑋 +s 𝑌)} ∧ {(𝑋 +s 𝑌)} <<s ({𝑒 ∣ ∃𝑓 ∈ ( R ‘𝑋)𝑒 = (𝑓 +s 𝑌)} ∪ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)})))
10	9	simp1d 1143	. . . . 5 ⊢ (𝜑 → (𝑋 +s 𝑌) ∈ No )
11	10	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑌) ∈ No )
12	7	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
13	8	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑋 ∈ No )
14		simprl 771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑚 ∈ No )
15		unidm 4097	. . . . . . 7 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝑚)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑚))) = (( bday ‘𝑋) +no ( bday ‘𝑚))
16		simprr1 1223	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ( bday ‘𝑚) ∈ ( bday ‘𝑌))
17		bdayon 27744	. . . . . . . . . 10 ⊢ ( bday ‘𝑚) ∈ On
18		bdayon 27744	. . . . . . . . . 10 ⊢ ( bday ‘𝑌) ∈ On
19		bdayon 27744	. . . . . . . . . 10 ⊢ ( bday ‘𝑋) ∈ On
20		naddel2 8624	. . . . . . . . . 10 ⊢ ((( bday ‘𝑚) ∈ On ∧ ( bday ‘𝑌) ∈ On ∧ ( bday ‘𝑋) ∈ On) → (( bday ‘𝑚) ∈ ( bday ‘𝑌) ↔ (( bday ‘𝑋) +no ( bday ‘𝑚)) ∈ (( bday ‘𝑋) +no ( bday ‘𝑌))))
21	17, 18, 19, 20	mp3an 1464	. . . . . . . . 9 ⊢ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ↔ (( bday ‘𝑋) +no ( bday ‘𝑚)) ∈ (( bday ‘𝑋) +no ( bday ‘𝑌)))
22	16, 21	sylib 218	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (( bday ‘𝑋) +no ( bday ‘𝑚)) ∈ (( bday ‘𝑋) +no ( bday ‘𝑌)))
23		elun1 4122	. . . . . . . 8 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝑚)) ∈ (( bday ‘𝑋) +no ( bday ‘𝑌)) → (( bday ‘𝑋) +no ( bday ‘𝑚)) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))))
24	22, 23	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (( bday ‘𝑋) +no ( bday ‘𝑚)) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))))
25	15, 24	eqeltrid 2840	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ((( bday ‘𝑋) +no ( bday ‘𝑚)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑚))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))))
26	12, 13, 14, 14, 25	addsproplem1 27961	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ((𝑋 +s 𝑚) ∈ No ∧ (𝑚 <s 𝑚 → (𝑚 +s 𝑋) <s (𝑚 +s 𝑋))))
27	26	simpld 494	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑚) ∈ No )
28		uncom 4098	. . . . . . . . . . . 12 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) = ((( bday ‘𝑋) +no ( bday ‘𝑍)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑌)))
29	28	eleq2i 2828	. . . . . . . . . . 11 ⊢ (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) ↔ ((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑍)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑌))))
30	29	imbi1i 349	. . . . . . . . . 10 ⊢ ((((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))) ↔ (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑍)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑌))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
31	30	ralbii 3083	. . . . . . . . 9 ⊢ (∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))) ↔ ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑍)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑌))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
32	31	2ralbii 3112	. . . . . . . 8 ⊢ (∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑍))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))) ↔ ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑍)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑌))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
33	7, 32	sylib 218	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑍)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑌))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
34	33, 8, 2	addsproplem3 27963	. . . . . 6 ⊢ (𝜑 → ((𝑋 +s 𝑍) ∈ No ∧ ({𝑎 ∣ ∃𝑏 ∈ ( L ‘𝑋)𝑎 = (𝑏 +s 𝑍)} ∪ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)}) <<s {(𝑋 +s 𝑍)} ∧ {(𝑋 +s 𝑍)} <<s ({𝑒 ∣ ∃𝑓 ∈ ( R ‘𝑋)𝑒 = (𝑓 +s 𝑍)} ∪ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑍)𝑔 = (𝑋 +s ℎ)})))
35	34	simp1d 1143	. . . . 5 ⊢ (𝜑 → (𝑋 +s 𝑍) ∈ No )
36	35	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑍) ∈ No )
37	9	simp3d 1145	. . . . . 6 ⊢ (𝜑 → {(𝑋 +s 𝑌)} <<s ({𝑒 ∣ ∃𝑓 ∈ ( R ‘𝑋)𝑒 = (𝑓 +s 𝑌)} ∪ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)}))
38	37	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → {(𝑋 +s 𝑌)} <<s ({𝑒 ∣ ∃𝑓 ∈ ( R ‘𝑋)𝑒 = (𝑓 +s 𝑌)} ∪ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)}))
39		ovex 7400	. . . . . . 7 ⊢ (𝑋 +s 𝑌) ∈ V
40	39	snid 4606	. . . . . 6 ⊢ (𝑋 +s 𝑌) ∈ {(𝑋 +s 𝑌)}
41	40	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑌) ∈ {(𝑋 +s 𝑌)})
42		oldbday 27893	. . . . . . . . . . 11 ⊢ ((( bday ‘𝑌) ∈ On ∧ 𝑚 ∈ No ) → (𝑚 ∈ ( O ‘( bday ‘𝑌)) ↔ ( bday ‘𝑚) ∈ ( bday ‘𝑌)))
43	18, 14, 42	sylancr 588	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑚 ∈ ( O ‘( bday ‘𝑌)) ↔ ( bday ‘𝑚) ∈ ( bday ‘𝑌)))
44	16, 43	mpbird 257	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑚 ∈ ( O ‘( bday ‘𝑌)))
45		simprr2 1224	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑌 <s 𝑚)
46		elright 27844	. . . . . . . . 9 ⊢ (𝑚 ∈ ( R ‘𝑌) ↔ (𝑚 ∈ ( O ‘( bday ‘𝑌)) ∧ 𝑌 <s 𝑚))
47	44, 45, 46	sylanbrc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑚 ∈ ( R ‘𝑌))
48		eqid 2736	. . . . . . . 8 ⊢ (𝑋 +s 𝑚) = (𝑋 +s 𝑚)
49		oveq2 7375	. . . . . . . . 9 ⊢ (ℎ = 𝑚 → (𝑋 +s ℎ) = (𝑋 +s 𝑚))
50	49	rspceeqv 3587	. . . . . . . 8 ⊢ ((𝑚 ∈ ( R ‘𝑌) ∧ (𝑋 +s 𝑚) = (𝑋 +s 𝑚)) → ∃ℎ ∈ ( R ‘𝑌)(𝑋 +s 𝑚) = (𝑋 +s ℎ))
51	47, 48, 50	sylancl 587	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ∃ℎ ∈ ( R ‘𝑌)(𝑋 +s 𝑚) = (𝑋 +s ℎ))
52		ovex 7400	. . . . . . . 8 ⊢ (𝑋 +s 𝑚) ∈ V
53		eqeq1 2740	. . . . . . . . 9 ⊢ (𝑔 = (𝑋 +s 𝑚) → (𝑔 = (𝑋 +s ℎ) ↔ (𝑋 +s 𝑚) = (𝑋 +s ℎ)))
54	53	rexbidv 3161	. . . . . . . 8 ⊢ (𝑔 = (𝑋 +s 𝑚) → (∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ) ↔ ∃ℎ ∈ ( R ‘𝑌)(𝑋 +s 𝑚) = (𝑋 +s ℎ)))
55	52, 54	elab 3622	. . . . . . 7 ⊢ ((𝑋 +s 𝑚) ∈ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)} ↔ ∃ℎ ∈ ( R ‘𝑌)(𝑋 +s 𝑚) = (𝑋 +s ℎ))
56	51, 55	sylibr 234	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑚) ∈ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)})
57		elun2 4123	. . . . . 6 ⊢ ((𝑋 +s 𝑚) ∈ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)} → (𝑋 +s 𝑚) ∈ ({𝑒 ∣ ∃𝑓 ∈ ( R ‘𝑋)𝑒 = (𝑓 +s 𝑌)} ∪ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)}))
58	56, 57	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑚) ∈ ({𝑒 ∣ ∃𝑓 ∈ ( R ‘𝑋)𝑒 = (𝑓 +s 𝑌)} ∪ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑌)𝑔 = (𝑋 +s ℎ)}))
59	38, 41, 58	sltssepcd 27764	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑌) <s (𝑋 +s 𝑚))
60	33	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑍)) ∪ (( bday ‘𝑋) +no ( bday ‘𝑌))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
61	2	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑍 ∈ No )
62	60, 13, 61	addsproplem3 27963	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ((𝑋 +s 𝑍) ∈ No ∧ ({𝑎 ∣ ∃𝑏 ∈ ( L ‘𝑋)𝑎 = (𝑏 +s 𝑍)} ∪ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)}) <<s {(𝑋 +s 𝑍)} ∧ {(𝑋 +s 𝑍)} <<s ({𝑒 ∣ ∃𝑓 ∈ ( R ‘𝑋)𝑒 = (𝑓 +s 𝑍)} ∪ {𝑔 ∣ ∃ℎ ∈ ( R ‘𝑍)𝑔 = (𝑋 +s ℎ)})))
63	62	simp2d 1144	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ({𝑎 ∣ ∃𝑏 ∈ ( L ‘𝑋)𝑎 = (𝑏 +s 𝑍)} ∪ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)}) <<s {(𝑋 +s 𝑍)})
64	3	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ( bday ‘𝑌) = ( bday ‘𝑍))
65	16, 64	eleqtrd 2838	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ( bday ‘𝑚) ∈ ( bday ‘𝑍))
66		bdayon 27744	. . . . . . . . . . 11 ⊢ ( bday ‘𝑍) ∈ On
67		oldbday 27893	. . . . . . . . . . 11 ⊢ ((( bday ‘𝑍) ∈ On ∧ 𝑚 ∈ No ) → (𝑚 ∈ ( O ‘( bday ‘𝑍)) ↔ ( bday ‘𝑚) ∈ ( bday ‘𝑍)))
68	66, 14, 67	sylancr 588	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑚 ∈ ( O ‘( bday ‘𝑍)) ↔ ( bday ‘𝑚) ∈ ( bday ‘𝑍)))
69	65, 68	mpbird 257	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑚 ∈ ( O ‘( bday ‘𝑍)))
70		simprr3 1225	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑚 <s 𝑍)
71		elleft 27843	. . . . . . . . 9 ⊢ (𝑚 ∈ ( L ‘𝑍) ↔ (𝑚 ∈ ( O ‘( bday ‘𝑍)) ∧ 𝑚 <s 𝑍))
72	69, 70, 71	sylanbrc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → 𝑚 ∈ ( L ‘𝑍))
73		oveq2 7375	. . . . . . . . 9 ⊢ (𝑑 = 𝑚 → (𝑋 +s 𝑑) = (𝑋 +s 𝑚))
74	73	rspceeqv 3587	. . . . . . . 8 ⊢ ((𝑚 ∈ ( L ‘𝑍) ∧ (𝑋 +s 𝑚) = (𝑋 +s 𝑚)) → ∃𝑑 ∈ ( L ‘𝑍)(𝑋 +s 𝑚) = (𝑋 +s 𝑑))
75	72, 48, 74	sylancl 587	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → ∃𝑑 ∈ ( L ‘𝑍)(𝑋 +s 𝑚) = (𝑋 +s 𝑑))
76		eqeq1 2740	. . . . . . . . 9 ⊢ (𝑐 = (𝑋 +s 𝑚) → (𝑐 = (𝑋 +s 𝑑) ↔ (𝑋 +s 𝑚) = (𝑋 +s 𝑑)))
77	76	rexbidv 3161	. . . . . . . 8 ⊢ (𝑐 = (𝑋 +s 𝑚) → (∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑) ↔ ∃𝑑 ∈ ( L ‘𝑍)(𝑋 +s 𝑚) = (𝑋 +s 𝑑)))
78	52, 77	elab 3622	. . . . . . 7 ⊢ ((𝑋 +s 𝑚) ∈ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)} ↔ ∃𝑑 ∈ ( L ‘𝑍)(𝑋 +s 𝑚) = (𝑋 +s 𝑑))
79	75, 78	sylibr 234	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑚) ∈ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)})
80		elun2 4123	. . . . . 6 ⊢ ((𝑋 +s 𝑚) ∈ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)} → (𝑋 +s 𝑚) ∈ ({𝑎 ∣ ∃𝑏 ∈ ( L ‘𝑋)𝑎 = (𝑏 +s 𝑍)} ∪ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)}))
81	79, 80	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑚) ∈ ({𝑎 ∣ ∃𝑏 ∈ ( L ‘𝑋)𝑎 = (𝑏 +s 𝑍)} ∪ {𝑐 ∣ ∃𝑑 ∈ ( L ‘𝑍)𝑐 = (𝑋 +s 𝑑)}))
82		ovex 7400	. . . . . . 7 ⊢ (𝑋 +s 𝑍) ∈ V
83	82	snid 4606	. . . . . 6 ⊢ (𝑋 +s 𝑍) ∈ {(𝑋 +s 𝑍)}
84	83	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑍) ∈ {(𝑋 +s 𝑍)})
85	63, 81, 84	sltssepcd 27764	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑚) <s (𝑋 +s 𝑍))
86	11, 27, 36, 59, 85	ltstrd 27727	. . 3 ⊢ ((𝜑 ∧ (𝑚 ∈ No ∧ (( bday ‘𝑚) ∈ ( bday ‘𝑌) ∧ 𝑌 <s 𝑚 ∧ 𝑚 <s 𝑍))) → (𝑋 +s 𝑌) <s (𝑋 +s 𝑍))
87	6, 86	rexlimddv 3144	. 2 ⊢ (𝜑 → (𝑋 +s 𝑌) <s (𝑋 +s 𝑍))
88	1, 8	addscomd 27959	. 2 ⊢ (𝜑 → (𝑌 +s 𝑋) = (𝑋 +s 𝑌))
89	2, 8	addscomd 27959	. 2 ⊢ (𝜑 → (𝑍 +s 𝑋) = (𝑋 +s 𝑍))
90	87, 88, 89	3brtr4d 5117	1 ⊢ (𝜑 → (𝑌 +s 𝑋) <s (𝑍 +s 𝑋))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {cab 2714  ∀wral 3051  ∃wrex 3061   ∪ cun 3887  {csn 4567   class class class wbr 5085  Oncon0 6323  ‘cfv 6498  (class class class)co 7367   +no cnadd 8601   No csur 27603   <s clts 27604   bday cbday 27605   <<s cslts 27749   O cold 27815   L cleft 27817   R cright 27818   +_s cadds 27951

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-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-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

This theorem is referenced by:  addsproplem7  27967