Theorem conway 27280

Description: Conway's Simplicity Theorem. Given 𝐴 preceeding 𝐵, there is a unique surreal of minimal length separating them. This is a fundamental property of surreals and will be used (via surreal cuts) to prove many properties later on. Theorem from [Alling] p. 185. (Contributed by Scott Fenton, 8-Dec-2021.)

Assertion

Ref	Expression
conway	⊢ (𝐴 <<s 𝐵 → ∃!𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem conway

Dummy variables 𝑝 𝑞 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssltss1 27270	. . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )
2		ssltex1 27268	. . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐴 ∈ V)
3		ssltss2 27271	. . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No )
4		ssltex2 27269	. . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐵 ∈ V)
5		ssltsep 27272	. . . . 5 ⊢ (𝐴 <<s 𝐵 → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐵 𝑝 <s 𝑞)
6		noeta2 27266	. . . . 5 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐵 𝑝 <s 𝑞) → ∃𝑦 ∈ No (∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞 ∧ ( bday ‘𝑦) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
7	1, 2, 3, 4, 5, 6	syl221anc 1382	. . . 4 ⊢ (𝐴 <<s 𝐵 → ∃𝑦 ∈ No (∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞 ∧ ( bday ‘𝑦) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
8		3simpa 1149	. . . . . 6 ⊢ ((∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞 ∧ ( bday ‘𝑦) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))) → (∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞))
9	2	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦) → 𝐴 ∈ V)
10		vsnex 5428	. . . . . . . . . 10 ⊢ {𝑦} ∈ V
11	9, 10	jctir 522	. . . . . . . . 9 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦) → (𝐴 ∈ V ∧ {𝑦} ∈ V))
12	1	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦) → 𝐴 ⊆ No )
13		snssi 4810	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ No → {𝑦} ⊆ No )
14	13	adantl 483	. . . . . . . . . . 11 ⊢ ((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) → {𝑦} ⊆ No )
15	14	adantr 482	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦) → {𝑦} ⊆ No )
16		vex 3479	. . . . . . . . . . . . . 14 ⊢ 𝑦 ∈ V
17		breq2 5151	. . . . . . . . . . . . . 14 ⊢ (𝑞 = 𝑦 → (𝑝 <s 𝑞 ↔ 𝑝 <s 𝑦))
18	16, 17	ralsn 4684	. . . . . . . . . . . . 13 ⊢ (∀𝑞 ∈ {𝑦}𝑝 <s 𝑞 ↔ 𝑝 <s 𝑦)
19	18	ralbii 3094	. . . . . . . . . . . 12 ⊢ (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ {𝑦}𝑝 <s 𝑞 ↔ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦)
20	19	biimpri 227	. . . . . . . . . . 11 ⊢ (∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ {𝑦}𝑝 <s 𝑞)
21	20	adantl 483	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦) → ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ {𝑦}𝑝 <s 𝑞)
22	12, 15, 21	3jca 1129	. . . . . . . . 9 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦) → (𝐴 ⊆ No ∧ {𝑦} ⊆ No ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ {𝑦}𝑝 <s 𝑞))
23		brsslt 27267	. . . . . . . . 9 ⊢ (𝐴 <<s {𝑦} ↔ ((𝐴 ∈ V ∧ {𝑦} ∈ V) ∧ (𝐴 ⊆ No ∧ {𝑦} ⊆ No ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ {𝑦}𝑝 <s 𝑞)))
24	11, 22, 23	sylanbrc 584	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑝 ∈ 𝐴 𝑝 <s 𝑦) → 𝐴 <<s {𝑦})
25	24	ex 414	. . . . . . 7 ⊢ ((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) → (∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 → 𝐴 <<s {𝑦}))
26	4	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → 𝐵 ∈ V)
27	26, 10	jctil 521	. . . . . . . . 9 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → ({𝑦} ∈ V ∧ 𝐵 ∈ V))
28	14	adantr 482	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → {𝑦} ⊆ No )
29	3	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → 𝐵 ⊆ No )
30		ralcom 3287	. . . . . . . . . . . 12 ⊢ (∀𝑝 ∈ {𝑦}∀𝑞 ∈ 𝐵 𝑝 <s 𝑞 ↔ ∀𝑞 ∈ 𝐵 ∀𝑝 ∈ {𝑦}𝑝 <s 𝑞)
31		breq1 5150	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑦 → (𝑝 <s 𝑞 ↔ 𝑦 <s 𝑞))
32	16, 31	ralsn 4684	. . . . . . . . . . . . 13 ⊢ (∀𝑝 ∈ {𝑦}𝑝 <s 𝑞 ↔ 𝑦 <s 𝑞)
33	32	ralbii 3094	. . . . . . . . . . . 12 ⊢ (∀𝑞 ∈ 𝐵 ∀𝑝 ∈ {𝑦}𝑝 <s 𝑞 ↔ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞)
34	30, 33	sylbbr 235	. . . . . . . . . . 11 ⊢ (∀𝑞 ∈ 𝐵 𝑦 <s 𝑞 → ∀𝑝 ∈ {𝑦}∀𝑞 ∈ 𝐵 𝑝 <s 𝑞)
35	34	adantl 483	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → ∀𝑝 ∈ {𝑦}∀𝑞 ∈ 𝐵 𝑝 <s 𝑞)
36	28, 29, 35	3jca 1129	. . . . . . . . 9 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → ({𝑦} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑝 ∈ {𝑦}∀𝑞 ∈ 𝐵 𝑝 <s 𝑞))
37		brsslt 27267	. . . . . . . . 9 ⊢ ({𝑦} <<s 𝐵 ↔ (({𝑦} ∈ V ∧ 𝐵 ∈ V) ∧ ({𝑦} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑝 ∈ {𝑦}∀𝑞 ∈ 𝐵 𝑝 <s 𝑞)))
38	27, 36, 37	sylanbrc 584	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → {𝑦} <<s 𝐵)
39	38	ex 414	. . . . . . 7 ⊢ ((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) → (∀𝑞 ∈ 𝐵 𝑦 <s 𝑞 → {𝑦} <<s 𝐵))
40	25, 39	anim12d 610	. . . . . 6 ⊢ ((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) → ((∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞) → (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)))
41	8, 40	syl5 34	. . . . 5 ⊢ ((𝐴 <<s 𝐵 ∧ 𝑦 ∈ No ) → ((∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞 ∧ ( bday ‘𝑦) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))) → (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)))
42	41	reximdva 3169	. . . 4 ⊢ (𝐴 <<s 𝐵 → (∃𝑦 ∈ No (∀𝑝 ∈ 𝐴 𝑝 <s 𝑦 ∧ ∀𝑞 ∈ 𝐵 𝑦 <s 𝑞 ∧ ( bday ‘𝑦) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))) → ∃𝑦 ∈ No (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)))
43	7, 42	mpd 15	. . 3 ⊢ (𝐴 <<s 𝐵 → ∃𝑦 ∈ No (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵))
44		rabn0 4384	. . 3 ⊢ ({𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ≠ ∅ ↔ ∃𝑦 ∈ No (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵))
45	43, 44	sylibr 233	. 2 ⊢ (𝐴 <<s 𝐵 → {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ≠ ∅)
46		ssrab2 4076	. . 3 ⊢ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ⊆ No
47	46	a1i 11	. 2 ⊢ (𝐴 <<s 𝐵 → {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ⊆ No )
48		simplr3 1218	. . . . . 6 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝑟 ∈ No )
49	2	ad2antrr 725	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝐴 ∈ V)
50		vsnex 5428	. . . . . . . 8 ⊢ {𝑟} ∈ V
51	49, 50	jctir 522	. . . . . . 7 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → (𝐴 ∈ V ∧ {𝑟} ∈ V))
52	1	ad2antrr 725	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝐴 ⊆ No )
53		snssi 4810	. . . . . . . . 9 ⊢ (𝑟 ∈ No → {𝑟} ⊆ No )
54	48, 53	syl 17	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → {𝑟} ⊆ No )
55	52	sselda 3981	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ No )
56		simplr1 1216	. . . . . . . . . . . 12 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝑝 ∈ No )
57	56	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → 𝑝 ∈ No )
58	48	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → 𝑟 ∈ No )
59		simplll 774	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞)) → 𝐴 <<s {𝑝})
60	59	adantl 483	. . . . . . . . . . . . . 14 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝐴 <<s {𝑝})
61		ssltsep 27272	. . . . . . . . . . . . . 14 ⊢ (𝐴 <<s {𝑝} → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ {𝑝}𝑥 <s 𝑦)
62	60, 61	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ {𝑝}𝑥 <s 𝑦)
63	62	r19.21bi 3249	. . . . . . . . . . . 12 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ {𝑝}𝑥 <s 𝑦)
64		vex 3479	. . . . . . . . . . . . 13 ⊢ 𝑝 ∈ V
65		breq2 5151	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑝 → (𝑥 <s 𝑦 ↔ 𝑥 <s 𝑝))
66	64, 65	ralsn 4684	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ {𝑝}𝑥 <s 𝑦 ↔ 𝑥 <s 𝑝)
67	63, 66	sylib 217	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → 𝑥 <s 𝑝)
68		simprrl 780	. . . . . . . . . . . 12 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝑝 <s 𝑟)
69	68	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → 𝑝 <s 𝑟)
70	55, 57, 58, 67, 69	slttrd 27242	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → 𝑥 <s 𝑟)
71		vex 3479	. . . . . . . . . . 11 ⊢ 𝑟 ∈ V
72		breq2 5151	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑟 → (𝑥 <s 𝑦 ↔ 𝑥 <s 𝑟))
73	71, 72	ralsn 4684	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ {𝑟}𝑥 <s 𝑦 ↔ 𝑥 <s 𝑟)
74	70, 73	sylibr 233	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ {𝑟}𝑥 <s 𝑦)
75	74	ralrimiva 3147	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ {𝑟}𝑥 <s 𝑦)
76	52, 54, 75	3jca 1129	. . . . . . 7 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → (𝐴 ⊆ No ∧ {𝑟} ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ {𝑟}𝑥 <s 𝑦))
77		brsslt 27267	. . . . . . 7 ⊢ (𝐴 <<s {𝑟} ↔ ((𝐴 ∈ V ∧ {𝑟} ∈ V) ∧ (𝐴 ⊆ No ∧ {𝑟} ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ {𝑟}𝑥 <s 𝑦)))
78	51, 76, 77	sylanbrc 584	. . . . . 6 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝐴 <<s {𝑟})
79	4	ad2antrr 725	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝐵 ∈ V)
80	79, 50	jctil 521	. . . . . . 7 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ({𝑟} ∈ V ∧ 𝐵 ∈ V))
81	3	ad2antrr 725	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝐵 ⊆ No )
82	48	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑦 ∈ 𝐵) → 𝑟 ∈ No )
83		simplr2 1217	. . . . . . . . . . . 12 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝑞 ∈ No )
84	83	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑦 ∈ 𝐵) → 𝑞 ∈ No )
85	81	sselda 3981	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ No )
86		simprrr 781	. . . . . . . . . . . 12 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → 𝑟 <s 𝑞)
87	86	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑦 ∈ 𝐵) → 𝑟 <s 𝑞)
88		simplrr 777	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞)) → {𝑞} <<s 𝐵)
89	88	adantl 483	. . . . . . . . . . . . . 14 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → {𝑞} <<s 𝐵)
90		ssltsep 27272	. . . . . . . . . . . . . 14 ⊢ ({𝑞} <<s 𝐵 → ∀𝑥 ∈ {𝑞}∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
91	89, 90	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ∀𝑥 ∈ {𝑞}∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
92		vex 3479	. . . . . . . . . . . . . 14 ⊢ 𝑞 ∈ V
93		breq1 5150	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑞 → (𝑥 <s 𝑦 ↔ 𝑞 <s 𝑦))
94	93	ralbidv 3178	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑞 → (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑞 <s 𝑦))
95	92, 94	ralsn 4684	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ {𝑞}∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑞 <s 𝑦)
96	91, 95	sylib 217	. . . . . . . . . . . 12 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ∀𝑦 ∈ 𝐵 𝑞 <s 𝑦)
97	96	r19.21bi 3249	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑦 ∈ 𝐵) → 𝑞 <s 𝑦)
98	82, 84, 85, 87, 97	slttrd 27242	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) ∧ 𝑦 ∈ 𝐵) → 𝑟 <s 𝑦)
99	98	ralrimiva 3147	. . . . . . . . 9 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ∀𝑦 ∈ 𝐵 𝑟 <s 𝑦)
100		breq1 5150	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑟 → (𝑥 <s 𝑦 ↔ 𝑟 <s 𝑦))
101	100	ralbidv 3178	. . . . . . . . . 10 ⊢ (𝑥 = 𝑟 → (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑟 <s 𝑦))
102	71, 101	ralsn 4684	. . . . . . . . 9 ⊢ (∀𝑥 ∈ {𝑟}∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑟 <s 𝑦)
103	99, 102	sylibr 233	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ∀𝑥 ∈ {𝑟}∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
104	54, 81, 103	3jca 1129	. . . . . . 7 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → ({𝑟} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ {𝑟}∀𝑦 ∈ 𝐵 𝑥 <s 𝑦))
105		brsslt 27267	. . . . . . 7 ⊢ ({𝑟} <<s 𝐵 ↔ (({𝑟} ∈ V ∧ 𝐵 ∈ V) ∧ ({𝑟} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ {𝑟}∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)))
106	80, 104, 105	sylanbrc 584	. . . . . 6 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → {𝑟} <<s 𝐵)
107	48, 78, 106	jca32 517	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) ∧ (((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) ∧ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)) ∧ (𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞))) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))
108	107	exp44 439	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ (𝑝 ∈ No ∧ 𝑞 ∈ No ∧ 𝑟 ∈ No )) → ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
109	108	ralrimivvva 3204	. . 3 ⊢ (𝐴 <<s 𝐵 → ∀𝑝 ∈ No ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
110		sneq 4637	. . . . . . 7 ⊢ (𝑦 = 𝑝 → {𝑦} = {𝑝})
111	110	breq2d 5159	. . . . . 6 ⊢ (𝑦 = 𝑝 → (𝐴 <<s {𝑦} ↔ 𝐴 <<s {𝑝}))
112	110	breq1d 5157	. . . . . 6 ⊢ (𝑦 = 𝑝 → ({𝑦} <<s 𝐵 ↔ {𝑝} <<s 𝐵))
113	111, 112	anbi12d 632	. . . . 5 ⊢ (𝑦 = 𝑝 → ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ↔ (𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵)))
114	113	ralrab 3688	. . . 4 ⊢ (∀𝑝 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))) ↔ ∀𝑝 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
115		sneq 4637	. . . . . . . . 9 ⊢ (𝑦 = 𝑞 → {𝑦} = {𝑞})
116	115	breq2d 5159	. . . . . . . 8 ⊢ (𝑦 = 𝑞 → (𝐴 <<s {𝑦} ↔ 𝐴 <<s {𝑞}))
117	115	breq1d 5157	. . . . . . . 8 ⊢ (𝑦 = 𝑞 → ({𝑦} <<s 𝐵 ↔ {𝑞} <<s 𝐵))
118	116, 117	anbi12d 632	. . . . . . 7 ⊢ (𝑦 = 𝑞 → ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ↔ (𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵)))
119	118	ralrab 3688	. . . . . 6 ⊢ (∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))) ↔ ∀𝑞 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))))
120		sneq 4637	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑟 → {𝑦} = {𝑟})
121	120	breq2d 5159	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑟 → (𝐴 <<s {𝑦} ↔ 𝐴 <<s {𝑟}))
122	120	breq1d 5157	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑟 → ({𝑦} <<s 𝐵 ↔ {𝑟} <<s 𝐵))
123	121, 122	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑦 = 𝑟 → ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ↔ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))
124	123	elrab 3682	. . . . . . . . 9 ⊢ (𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ↔ (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))
125	124	imbi2i 336	. . . . . . . 8 ⊢ (((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ↔ ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))
126	125	ralbii 3094	. . . . . . 7 ⊢ (∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ↔ ∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))
127	126	ralbii 3094	. . . . . 6 ⊢ (∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ↔ ∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))
128		r19.21v 3180	. . . . . . 7 ⊢ (∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))) ↔ ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))))
129	128	ralbii 3094	. . . . . 6 ⊢ (∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))) ↔ ∀𝑞 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))))
130	119, 127, 129	3bitr4i 303	. . . . 5 ⊢ (∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ↔ ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))))
131	130	ralbii 3094	. . . 4 ⊢ (∀𝑝 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ↔ ∀𝑝 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵)))))
132		r19.21v 3180	. . . . . . 7 ⊢ (∀𝑟 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))) ↔ ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
133	132	ralbii 3094	. . . . . 6 ⊢ (∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))) ↔ ∀𝑞 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
134		r19.21v 3180	. . . . . 6 ⊢ (∀𝑞 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))) ↔ ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
135	133, 134	bitri 275	. . . . 5 ⊢ (∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))) ↔ ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
136	135	ralbii 3094	. . . 4 ⊢ (∀𝑝 ∈ No ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))) ↔ ∀𝑝 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
137	114, 131, 136	3bitr4i 303	. . 3 ⊢ (∀𝑝 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}) ↔ ∀𝑝 ∈ No ∀𝑞 ∈ No ∀𝑟 ∈ No ((𝐴 <<s {𝑝} ∧ {𝑝} <<s 𝐵) → ((𝐴 <<s {𝑞} ∧ {𝑞} <<s 𝐵) → ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → (𝑟 ∈ No ∧ (𝐴 <<s {𝑟} ∧ {𝑟} <<s 𝐵))))))
138	109, 137	sylibr 233	. 2 ⊢ (𝐴 <<s 𝐵 → ∀𝑝 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
139		nocvxmin 27260	. 2 ⊢ (({𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ≠ ∅ ∧ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ⊆ No ∧ ∀𝑝 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑞 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}∀𝑟 ∈ No ((𝑝 <s 𝑟 ∧ 𝑟 <s 𝑞) → 𝑟 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)})) → ∃!𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))
140	45, 47, 138, 139	syl3anc 1372	1 ⊢ (𝐴 <<s 𝐵 → ∃!𝑥 ∈ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)} ( bday ‘𝑥) = ∩ ( bday “ {𝑦 ∈ No ∣ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)}))

Syntax hints:   → wi 4   ∧ wa 397   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107   ≠ wne 2941  ∀wral 3062  ∃wrex 3071  ∃!wreu 3375  {crab 3433  Vcvv 3475   ∪ cun 3945   ⊆ wss 3947  ∅c0 4321  {csn 4627  ∪ cuni 4907  ∩ cint 4949   class class class wbr 5147   “ cima 5678  suc csuc 6363  ‘cfv 6540   No csur 27123   <s cslt 27124   bday cbday 27125   <<s csslt 27262

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7720

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-tp 4632  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7360  df-1o 8461  df-2o 8462  df-no 27126  df-slt 27127  df-bday 27128  df-sslt 27263

This theorem is referenced by:  scutcut  27282  scutbday  27285  eqscut  27286  scutun12  27291  scutbdaylt  27299