Theorem slerec 33390

Description: A comparison law for surreals considered as cuts of sets of surreals. In Conway's treatment, this is the definition of less than or equal. (Contributed by Scott Fenton, 11-Dec-2021.)

Assertion

Ref	Expression
slerec	⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝑋 ≤s 𝑌 ↔ (∀𝑑 ∈ 𝐷 𝑋 <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑌)))

Distinct variable groups:   𝐴,𝑎,𝑑   𝐵,𝑎,𝑑   𝐶,𝑎,𝑑   𝐷,𝑎,𝑑   𝑋,𝑎,𝑑   𝑌,𝑎,𝑑

Proof of Theorem slerec

Dummy variables 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		scutcut 33379	. . . . . . . . 9 ⊢ (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No ∧ 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
2	1	simp1d 1139	. . . . . . . 8 ⊢ (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) ∈ No )
3	2	ad3antrrr 729	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑑 ∈ 𝐷) → (𝐴 |s 𝐵) ∈ No )
4		scutcut 33379	. . . . . . . . 9 ⊢ (𝐶 <<s 𝐷 → ((𝐶 |s 𝐷) ∈ No ∧ 𝐶 <<s {(𝐶 |s 𝐷)} ∧ {(𝐶 |s 𝐷)} <<s 𝐷))
5	4	simp1d 1139	. . . . . . . 8 ⊢ (𝐶 <<s 𝐷 → (𝐶 |s 𝐷) ∈ No )
6	5	ad3antlr 730	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑑 ∈ 𝐷) → (𝐶 |s 𝐷) ∈ No )
7		ssltss2 33371	. . . . . . . . 9 ⊢ (𝐶 <<s 𝐷 → 𝐷 ⊆ No )
8	7	ad2antlr 726	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → 𝐷 ⊆ No )
9	8	sselda 3915	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑑 ∈ 𝐷) → 𝑑 ∈ No )
10		simplr 768	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑑 ∈ 𝐷) → (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷))
11	4	simp3d 1141	. . . . . . . . . . 11 ⊢ (𝐶 <<s 𝐷 → {(𝐶 |s 𝐷)} <<s 𝐷)
12	11	ad2antlr 726	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → {(𝐶 |s 𝐷)} <<s 𝐷)
13		ssltsep 33372	. . . . . . . . . 10 ⊢ ({(𝐶 |s 𝐷)} <<s 𝐷 → ∀𝑎 ∈ {(𝐶 |s 𝐷)}∀𝑑 ∈ 𝐷 𝑎 <s 𝑑)
14	12, 13	syl 17	. . . . . . . . 9 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → ∀𝑎 ∈ {(𝐶 |s 𝐷)}∀𝑑 ∈ 𝐷 𝑎 <s 𝑑)
15		ovex 7168	. . . . . . . . . 10 ⊢ (𝐶 |s 𝐷) ∈ V
16		breq1 5033	. . . . . . . . . . 11 ⊢ (𝑎 = (𝐶 |s 𝐷) → (𝑎 <s 𝑑 ↔ (𝐶 |s 𝐷) <s 𝑑))
17	16	ralbidv 3162	. . . . . . . . . 10 ⊢ (𝑎 = (𝐶 |s 𝐷) → (∀𝑑 ∈ 𝐷 𝑎 <s 𝑑 ↔ ∀𝑑 ∈ 𝐷 (𝐶 |s 𝐷) <s 𝑑))
18	15, 17	ralsn 4579	. . . . . . . . 9 ⊢ (∀𝑎 ∈ {(𝐶 |s 𝐷)}∀𝑑 ∈ 𝐷 𝑎 <s 𝑑 ↔ ∀𝑑 ∈ 𝐷 (𝐶 |s 𝐷) <s 𝑑)
19	14, 18	sylib 221	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → ∀𝑑 ∈ 𝐷 (𝐶 |s 𝐷) <s 𝑑)
20	19	r19.21bi 3173	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑑 ∈ 𝐷) → (𝐶 |s 𝐷) <s 𝑑)
21	3, 6, 9, 10, 20	slelttrd 33353	. . . . . 6 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑑 ∈ 𝐷) → (𝐴 |s 𝐵) <s 𝑑)
22	21	ralrimiva 3149	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → ∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑)
23		ssltss1 33370	. . . . . . . . . 10 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )
24	23	adantr 484	. . . . . . . . 9 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) → 𝐴 ⊆ No )
25	24	adantr 484	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → 𝐴 ⊆ No )
26	25	sselda 3915	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ No )
27	2	ad3antrrr 729	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑎 ∈ 𝐴) → (𝐴 |s 𝐵) ∈ No )
28	5	ad3antlr 730	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑎 ∈ 𝐴) → (𝐶 |s 𝐷) ∈ No )
29	1	simp2d 1140	. . . . . . . . . . . 12 ⊢ (𝐴 <<s 𝐵 → 𝐴 <<s {(𝐴 |s 𝐵)})
30	29	adantr 484	. . . . . . . . . . 11 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) → 𝐴 <<s {(𝐴 |s 𝐵)})
31	30	adantr 484	. . . . . . . . . 10 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → 𝐴 <<s {(𝐴 |s 𝐵)})
32		ssltsep 33372	. . . . . . . . . 10 ⊢ (𝐴 <<s {(𝐴 |s 𝐵)} → ∀𝑎 ∈ 𝐴 ∀𝑑 ∈ {(𝐴 |s 𝐵)}𝑎 <s 𝑑)
33	31, 32	syl 17	. . . . . . . . 9 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → ∀𝑎 ∈ 𝐴 ∀𝑑 ∈ {(𝐴 |s 𝐵)}𝑎 <s 𝑑)
34	33	r19.21bi 3173	. . . . . . . 8 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑎 ∈ 𝐴) → ∀𝑑 ∈ {(𝐴 |s 𝐵)}𝑎 <s 𝑑)
35		ovex 7168	. . . . . . . . 9 ⊢ (𝐴 |s 𝐵) ∈ V
36		breq2 5034	. . . . . . . . 9 ⊢ (𝑑 = (𝐴 |s 𝐵) → (𝑎 <s 𝑑 ↔ 𝑎 <s (𝐴 |s 𝐵)))
37	35, 36	ralsn 4579	. . . . . . . 8 ⊢ (∀𝑑 ∈ {(𝐴 |s 𝐵)}𝑎 <s 𝑑 ↔ 𝑎 <s (𝐴 |s 𝐵))
38	34, 37	sylib 221	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑎 ∈ 𝐴) → 𝑎 <s (𝐴 |s 𝐵))
39		simplr 768	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑎 ∈ 𝐴) → (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷))
40	26, 27, 28, 38, 39	sltletrd 33352	. . . . . 6 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) ∧ 𝑎 ∈ 𝐴) → 𝑎 <s (𝐶 |s 𝐷))
41	40	ralrimiva 3149	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))
42	22, 41	jca 515	. . . 4 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)) → (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷)))
43		bdayelon 33359	. . . . . . 7 ⊢ ( bday ‘(𝐴 |s 𝐵)) ∈ On
44	43	onordi 6263	. . . . . 6 ⊢ Ord ( bday ‘(𝐴 |s 𝐵))
45		ordn2lp 6179	. . . . . 6 ⊢ (Ord ( bday ‘(𝐴 |s 𝐵)) → ¬ (( bday ‘(𝐴 |s 𝐵)) ∈ ( bday ‘(𝐶 |s 𝐷)) ∧ ( bday ‘(𝐶 |s 𝐷)) ∈ ( bday ‘(𝐴 |s 𝐵))))
46	44, 45	ax-mp 5	. . . . 5 ⊢ ¬ (( bday ‘(𝐴 |s 𝐵)) ∈ ( bday ‘(𝐶 |s 𝐷)) ∧ ( bday ‘(𝐶 |s 𝐷)) ∈ ( bday ‘(𝐴 |s 𝐵)))
47	5	ad2antlr 726	. . . . . . 7 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → (𝐶 |s 𝐷) ∈ No )
48	2	adantr 484	. . . . . . . 8 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) → (𝐴 |s 𝐵) ∈ No )
49	48	adantr 484	. . . . . . 7 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → (𝐴 |s 𝐵) ∈ No )
50		sltnle 33345	. . . . . . 7 ⊢ (((𝐶 |s 𝐷) ∈ No ∧ (𝐴 |s 𝐵) ∈ No ) → ((𝐶 |s 𝐷) <s (𝐴 |s 𝐵) ↔ ¬ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)))
51	47, 49, 50	syl2anc 587	. . . . . 6 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → ((𝐶 |s 𝐷) <s (𝐴 |s 𝐵) ↔ ¬ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)))
52	5	ad3antlr 730	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐶 |s 𝐷) ∈ No )
53		ssltex1 33368	. . . . . . . . . . . 12 ⊢ (𝐴 <<s 𝐵 → 𝐴 ∈ V)
54	53	ad3antrrr 729	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐴 ∈ V)
55		snex 5297	. . . . . . . . . . 11 ⊢ {(𝐶 |s 𝐷)} ∈ V
56	54, 55	jctir 524	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐴 ∈ V ∧ {(𝐶 |s 𝐷)} ∈ V))
57	23	ad3antrrr 729	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐴 ⊆ No )
58	52	snssd 4702	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → {(𝐶 |s 𝐷)} ⊆ No )
59		simplrr 777	. . . . . . . . . . . 12 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))
60		breq2 5034	. . . . . . . . . . . . . 14 ⊢ (𝑑 = (𝐶 |s 𝐷) → (𝑎 <s 𝑑 ↔ 𝑎 <s (𝐶 |s 𝐷)))
61	15, 60	ralsn 4579	. . . . . . . . . . . . 13 ⊢ (∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑎 <s 𝑑 ↔ 𝑎 <s (𝐶 |s 𝐷))
62	61	ralbii 3133	. . . . . . . . . . . 12 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑎 <s 𝑑 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))
63	59, 62	sylibr 237	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑎 ∈ 𝐴 ∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑎 <s 𝑑)
64	57, 58, 63	3jca 1125	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐴 ⊆ No ∧ {(𝐶 |s 𝐷)} ⊆ No ∧ ∀𝑎 ∈ 𝐴 ∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑎 <s 𝑑))
65		brsslt 33367	. . . . . . . . . 10 ⊢ (𝐴 <<s {(𝐶 |s 𝐷)} ↔ ((𝐴 ∈ V ∧ {(𝐶 |s 𝐷)} ∈ V) ∧ (𝐴 ⊆ No ∧ {(𝐶 |s 𝐷)} ⊆ No ∧ ∀𝑎 ∈ 𝐴 ∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑎 <s 𝑑)))
66	56, 64, 65	sylanbrc 586	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐴 <<s {(𝐶 |s 𝐷)})
67		ssltex2 33369	. . . . . . . . . . . 12 ⊢ (𝐴 <<s 𝐵 → 𝐵 ∈ V)
68	67	ad3antrrr 729	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐵 ∈ V)
69	68, 55	jctil 523	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ({(𝐶 |s 𝐷)} ∈ V ∧ 𝐵 ∈ V))
70		ssltss2 33371	. . . . . . . . . . . 12 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No )
71	70	ad3antrrr 729	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐵 ⊆ No )
72	52	adantr 484	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑏 ∈ 𝐵) → (𝐶 |s 𝐷) ∈ No )
73	48	ad3antrrr 729	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑏 ∈ 𝐵) → (𝐴 |s 𝐵) ∈ No )
74	71	sselda 3915	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ No )
75		simplr 768	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑏 ∈ 𝐵) → (𝐶 |s 𝐷) <s (𝐴 |s 𝐵))
76	1	simp3d 1141	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 <<s 𝐵 → {(𝐴 |s 𝐵)} <<s 𝐵)
77	76	ad3antrrr 729	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → {(𝐴 |s 𝐵)} <<s 𝐵)
78		ssltsep 33372	. . . . . . . . . . . . . . . . 17 ⊢ ({(𝐴 |s 𝐵)} <<s 𝐵 → ∀𝑎 ∈ {(𝐴 |s 𝐵)}∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)
79	77, 78	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑎 ∈ {(𝐴 |s 𝐵)}∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)
80		breq1 5033	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = (𝐴 |s 𝐵) → (𝑎 <s 𝑏 ↔ (𝐴 |s 𝐵) <s 𝑏))
81	80	ralbidv 3162	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = (𝐴 |s 𝐵) → (∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 (𝐴 |s 𝐵) <s 𝑏))
82	35, 81	ralsn 4579	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑎 ∈ {(𝐴 |s 𝐵)}∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 (𝐴 |s 𝐵) <s 𝑏)
83	79, 82	sylib 221	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑏 ∈ 𝐵 (𝐴 |s 𝐵) <s 𝑏)
84	83	r19.21bi 3173	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑏 ∈ 𝐵) → (𝐴 |s 𝐵) <s 𝑏)
85	72, 73, 74, 75, 84	slttrd 33351	. . . . . . . . . . . . 13 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑏 ∈ 𝐵) → (𝐶 |s 𝐷) <s 𝑏)
86	85	ralrimiva 3149	. . . . . . . . . . . 12 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑏 ∈ 𝐵 (𝐶 |s 𝐷) <s 𝑏)
87		breq1 5033	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (𝐶 |s 𝐷) → (𝑎 <s 𝑏 ↔ (𝐶 |s 𝐷) <s 𝑏))
88	87	ralbidv 3162	. . . . . . . . . . . . 13 ⊢ (𝑎 = (𝐶 |s 𝐷) → (∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 (𝐶 |s 𝐷) <s 𝑏))
89	15, 88	ralsn 4579	. . . . . . . . . . . 12 ⊢ (∀𝑎 ∈ {(𝐶 |s 𝐷)}∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 (𝐶 |s 𝐷) <s 𝑏)
90	86, 89	sylibr 237	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑎 ∈ {(𝐶 |s 𝐷)}∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)
91	58, 71, 90	3jca 1125	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ({(𝐶 |s 𝐷)} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑎 ∈ {(𝐶 |s 𝐷)}∀𝑏 ∈ 𝐵 𝑎 <s 𝑏))
92		brsslt 33367	. . . . . . . . . 10 ⊢ ({(𝐶 |s 𝐷)} <<s 𝐵 ↔ (({(𝐶 |s 𝐷)} ∈ V ∧ 𝐵 ∈ V) ∧ ({(𝐶 |s 𝐷)} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑎 ∈ {(𝐶 |s 𝐷)}∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)))
93	69, 91, 92	sylanbrc 586	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → {(𝐶 |s 𝐷)} <<s 𝐵)
94		sltirr 33338	. . . . . . . . . . . . . 14 ⊢ ((𝐴 |s 𝐵) ∈ No → ¬ (𝐴 |s 𝐵) <s (𝐴 |s 𝐵))
95	49, 94	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → ¬ (𝐴 |s 𝐵) <s (𝐴 |s 𝐵))
96		breq1 5033	. . . . . . . . . . . . . 14 ⊢ ((𝐴 |s 𝐵) = (𝐶 |s 𝐷) → ((𝐴 |s 𝐵) <s (𝐴 |s 𝐵) ↔ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)))
97	96	notbid 321	. . . . . . . . . . . . 13 ⊢ ((𝐴 |s 𝐵) = (𝐶 |s 𝐷) → (¬ (𝐴 |s 𝐵) <s (𝐴 |s 𝐵) ↔ ¬ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)))
98	95, 97	syl5ibcom 248	. . . . . . . . . . . 12 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → ((𝐴 |s 𝐵) = (𝐶 |s 𝐷) → ¬ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)))
99	98	necon2ad 3002	. . . . . . . . . . 11 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → ((𝐶 |s 𝐷) <s (𝐴 |s 𝐵) → (𝐴 |s 𝐵) ≠ (𝐶 |s 𝐷)))
100	99	imp 410	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐴 |s 𝐵) ≠ (𝐶 |s 𝐷))
101	100	necomd 3042	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐶 |s 𝐷) ≠ (𝐴 |s 𝐵))
102		scutbdaylt 33389	. . . . . . . . 9 ⊢ (((𝐶 |s 𝐷) ∈ No ∧ (𝐴 <<s {(𝐶 |s 𝐷)} ∧ {(𝐶 |s 𝐷)} <<s 𝐵) ∧ (𝐶 |s 𝐷) ≠ (𝐴 |s 𝐵)) → ( bday ‘(𝐴 |s 𝐵)) ∈ ( bday ‘(𝐶 |s 𝐷)))
103	52, 66, 93, 101, 102	syl121anc 1372	. . . . . . . 8 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ( bday ‘(𝐴 |s 𝐵)) ∈ ( bday ‘(𝐶 |s 𝐷)))
104	2	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐴 |s 𝐵) ∈ No )
105		ssltex1 33368	. . . . . . . . . . . 12 ⊢ (𝐶 <<s 𝐷 → 𝐶 ∈ V)
106	105	ad3antlr 730	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐶 ∈ V)
107		snex 5297	. . . . . . . . . . 11 ⊢ {(𝐴 |s 𝐵)} ∈ V
108	106, 107	jctir 524	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐶 ∈ V ∧ {(𝐴 |s 𝐵)} ∈ V))
109		ssltss1 33370	. . . . . . . . . . . 12 ⊢ (𝐶 <<s 𝐷 → 𝐶 ⊆ No )
110	109	ad3antlr 730	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐶 ⊆ No )
111	104	snssd 4702	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → {(𝐴 |s 𝐵)} ⊆ No )
112	110	sselda 3915	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → 𝑐 ∈ No )
113	52	adantr 484	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → (𝐶 |s 𝐷) ∈ No )
114	48	ad3antrrr 729	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → (𝐴 |s 𝐵) ∈ No )
115	4	simp2d 1140	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐶 <<s 𝐷 → 𝐶 <<s {(𝐶 |s 𝐷)})
116	115	ad3antlr 730	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐶 <<s {(𝐶 |s 𝐷)})
117		ssltsep 33372	. . . . . . . . . . . . . . . . 17 ⊢ (𝐶 <<s {(𝐶 |s 𝐷)} → ∀𝑐 ∈ 𝐶 ∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑐 <s 𝑑)
118	116, 117	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑐 ∈ 𝐶 ∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑐 <s 𝑑)
119	118	r19.21bi 3173	. . . . . . . . . . . . . . 15 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → ∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑐 <s 𝑑)
120		breq2 5034	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = (𝐶 |s 𝐷) → (𝑐 <s 𝑑 ↔ 𝑐 <s (𝐶 |s 𝐷)))
121	15, 120	ralsn 4579	. . . . . . . . . . . . . . 15 ⊢ (∀𝑑 ∈ {(𝐶 |s 𝐷)}𝑐 <s 𝑑 ↔ 𝑐 <s (𝐶 |s 𝐷))
122	119, 121	sylib 221	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → 𝑐 <s (𝐶 |s 𝐷))
123		simplr 768	. . . . . . . . . . . . . 14 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → (𝐶 |s 𝐷) <s (𝐴 |s 𝐵))
124	112, 113, 114, 122, 123	slttrd 33351	. . . . . . . . . . . . 13 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → 𝑐 <s (𝐴 |s 𝐵))
125		breq2 5034	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (𝐴 |s 𝐵) → (𝑐 <s 𝑎 ↔ 𝑐 <s (𝐴 |s 𝐵)))
126	35, 125	ralsn 4579	. . . . . . . . . . . . 13 ⊢ (∀𝑎 ∈ {(𝐴 |s 𝐵)}𝑐 <s 𝑎 ↔ 𝑐 <s (𝐴 |s 𝐵))
127	124, 126	sylibr 237	. . . . . . . . . . . 12 ⊢ (((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) ∧ 𝑐 ∈ 𝐶) → ∀𝑎 ∈ {(𝐴 |s 𝐵)}𝑐 <s 𝑎)
128	127	ralrimiva 3149	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑐 ∈ 𝐶 ∀𝑎 ∈ {(𝐴 |s 𝐵)}𝑐 <s 𝑎)
129	110, 111, 128	3jca 1125	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (𝐶 ⊆ No ∧ {(𝐴 |s 𝐵)} ⊆ No ∧ ∀𝑐 ∈ 𝐶 ∀𝑎 ∈ {(𝐴 |s 𝐵)}𝑐 <s 𝑎))
130		brsslt 33367	. . . . . . . . . 10 ⊢ (𝐶 <<s {(𝐴 |s 𝐵)} ↔ ((𝐶 ∈ V ∧ {(𝐴 |s 𝐵)} ∈ V) ∧ (𝐶 ⊆ No ∧ {(𝐴 |s 𝐵)} ⊆ No ∧ ∀𝑐 ∈ 𝐶 ∀𝑎 ∈ {(𝐴 |s 𝐵)}𝑐 <s 𝑎)))
131	108, 129, 130	sylanbrc 586	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐶 <<s {(𝐴 |s 𝐵)})
132		ssltex2 33369	. . . . . . . . . . . 12 ⊢ (𝐶 <<s 𝐷 → 𝐷 ∈ V)
133	132	ad3antlr 730	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐷 ∈ V)
134	133, 107	jctil 523	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ({(𝐴 |s 𝐵)} ∈ V ∧ 𝐷 ∈ V))
135	7	ad3antlr 730	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → 𝐷 ⊆ No )
136		simplrl 776	. . . . . . . . . . . 12 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑)
137		breq1 5033	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (𝐴 |s 𝐵) → (𝑎 <s 𝑑 ↔ (𝐴 |s 𝐵) <s 𝑑))
138	137	ralbidv 3162	. . . . . . . . . . . . 13 ⊢ (𝑎 = (𝐴 |s 𝐵) → (∀𝑑 ∈ 𝐷 𝑎 <s 𝑑 ↔ ∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑))
139	35, 138	ralsn 4579	. . . . . . . . . . . 12 ⊢ (∀𝑎 ∈ {(𝐴 |s 𝐵)}∀𝑑 ∈ 𝐷 𝑎 <s 𝑑 ↔ ∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑)
140	136, 139	sylibr 237	. . . . . . . . . . 11 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ∀𝑎 ∈ {(𝐴 |s 𝐵)}∀𝑑 ∈ 𝐷 𝑎 <s 𝑑)
141	111, 135, 140	3jca 1125	. . . . . . . . . 10 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ({(𝐴 |s 𝐵)} ⊆ No ∧ 𝐷 ⊆ No ∧ ∀𝑎 ∈ {(𝐴 |s 𝐵)}∀𝑑 ∈ 𝐷 𝑎 <s 𝑑))
142		brsslt 33367	. . . . . . . . . 10 ⊢ ({(𝐴 |s 𝐵)} <<s 𝐷 ↔ (({(𝐴 |s 𝐵)} ∈ V ∧ 𝐷 ∈ V) ∧ ({(𝐴 |s 𝐵)} ⊆ No ∧ 𝐷 ⊆ No ∧ ∀𝑎 ∈ {(𝐴 |s 𝐵)}∀𝑑 ∈ 𝐷 𝑎 <s 𝑑)))
143	134, 141, 142	sylanbrc 586	. . . . . . . . 9 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → {(𝐴 |s 𝐵)} <<s 𝐷)
144		scutbdaylt 33389	. . . . . . . . 9 ⊢ (((𝐴 |s 𝐵) ∈ No ∧ (𝐶 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐷) ∧ (𝐴 |s 𝐵) ≠ (𝐶 |s 𝐷)) → ( bday ‘(𝐶 |s 𝐷)) ∈ ( bday ‘(𝐴 |s 𝐵)))
145	104, 131, 143, 100, 144	syl121anc 1372	. . . . . . . 8 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → ( bday ‘(𝐶 |s 𝐷)) ∈ ( bday ‘(𝐴 |s 𝐵)))
146	103, 145	jca 515	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) ∧ (𝐶 |s 𝐷) <s (𝐴 |s 𝐵)) → (( bday ‘(𝐴 |s 𝐵)) ∈ ( bday ‘(𝐶 |s 𝐷)) ∧ ( bday ‘(𝐶 |s 𝐷)) ∈ ( bday ‘(𝐴 |s 𝐵))))
147	146	ex 416	. . . . . 6 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → ((𝐶 |s 𝐷) <s (𝐴 |s 𝐵) → (( bday ‘(𝐴 |s 𝐵)) ∈ ( bday ‘(𝐶 |s 𝐷)) ∧ ( bday ‘(𝐶 |s 𝐷)) ∈ ( bday ‘(𝐴 |s 𝐵)))))
148	51, 147	sylbird 263	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → (¬ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷) → (( bday ‘(𝐴 |s 𝐵)) ∈ ( bday ‘(𝐶 |s 𝐷)) ∧ ( bday ‘(𝐶 |s 𝐷)) ∈ ( bday ‘(𝐴 |s 𝐵)))))
149	46, 148	mt3i 151	. . . 4 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))) → (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷))
150	42, 149	impbida 800	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) → ((𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷) ↔ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))))
151		breq12 5035	. . . 4 ⊢ ((𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷)) → (𝑋 ≤s 𝑌 ↔ (𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷)))
152		breq1 5033	. . . . . 6 ⊢ (𝑋 = (𝐴 |s 𝐵) → (𝑋 <s 𝑑 ↔ (𝐴 |s 𝐵) <s 𝑑))
153	152	ralbidv 3162	. . . . 5 ⊢ (𝑋 = (𝐴 |s 𝐵) → (∀𝑑 ∈ 𝐷 𝑋 <s 𝑑 ↔ ∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑))
154		breq2 5034	. . . . . 6 ⊢ (𝑌 = (𝐶 |s 𝐷) → (𝑎 <s 𝑌 ↔ 𝑎 <s (𝐶 |s 𝐷)))
155	154	ralbidv 3162	. . . . 5 ⊢ (𝑌 = (𝐶 |s 𝐷) → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑌 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷)))
156	153, 155	bi2anan9 638	. . . 4 ⊢ ((𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷)) → ((∀𝑑 ∈ 𝐷 𝑋 <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑌) ↔ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷))))
157	151, 156	bibi12d 349	. . 3 ⊢ ((𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷)) → ((𝑋 ≤s 𝑌 ↔ (∀𝑑 ∈ 𝐷 𝑋 <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑌)) ↔ ((𝐴 |s 𝐵) ≤s (𝐶 |s 𝐷) ↔ (∀𝑑 ∈ 𝐷 (𝐴 |s 𝐵) <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s (𝐶 |s 𝐷)))))
158	150, 157	syl5ibr 249	. 2 ⊢ ((𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷)) → ((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) → (𝑋 ≤s 𝑌 ↔ (∀𝑑 ∈ 𝐷 𝑋 <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑌))))
159	158	impcom 411	1 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝑋 ≤s 𝑌 ↔ (∀𝑑 ∈ 𝐷 𝑋 <s 𝑑 ∧ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑌)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   ≠ wne 2987  ∀wral 3106  Vcvv 3441   ⊆ wss 3881  {csn 4525   class class class wbr 5030  Ord word 6158  ‘cfv 6324  (class class class)co 7135   No csur 33260   <s cslt 33261   bday cbday 33262   ≤s csle 33336   <<s csslt 33363   |s cscut 33365

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-ord 6162  df-on 6163  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1o 8085  df-2o 8086  df-no 33263  df-slt 33264  df-bday 33265  df-sle 33337  df-sslt 33364  df-scut 33366

This theorem is referenced by:  sltrec  33391