Theorem nosupinfsep 27711

Description: Given two sets of surreals, a surreal 𝑊 separates them iff its restriction to the maximum of dom 𝑆 and dom 𝑇 separates them. Corollary 4.4 of [Lipparini] p. 7. (Contributed by Scott Fenton, 9-Aug-2024.)

Hypotheses

Ref	Expression
nosupinfsep.1	⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
nosupinfsep.2	⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))

Assertion

Ref	Expression
nosupinfsep	⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑊 ∧ ∀𝑏 ∈ 𝐵 𝑊 <s 𝑏) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∧ ∀𝑏 ∈ 𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏)))

Distinct variable groups:   𝐴,𝑎,𝑔,𝑢,𝑣,𝑥,𝑦   𝐵,𝑏,𝑔   𝑢,𝐵   𝑣,𝑏,𝐵,𝑥,𝑦   𝑢,𝑔,𝑣,𝑥,𝑦   𝑆,𝑎   𝑆,𝑏,𝑔,𝑥   𝑇,𝑎   𝑇,𝑏,𝑔,𝑥   𝑣,𝑢,𝑥,𝑦   𝑊,𝑎   𝑊,𝑏,𝑔,𝑥   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑏)   𝐵(𝑎)   𝑆(𝑦,𝑣,𝑢)   𝑇(𝑦,𝑣,𝑢)   𝑊(𝑦,𝑣,𝑢)

Proof of Theorem nosupinfsep

Step	Hyp	Ref	Expression
1		ssun1 4170	. . . . . . . 8 ⊢ dom 𝑆 ⊆ (dom 𝑆 ∪ dom 𝑇)
2		resabs1 6012	. . . . . . . 8 ⊢ (dom 𝑆 ⊆ (dom 𝑆 ∪ dom 𝑇) → ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) = (𝑊 ↾ dom 𝑆))
3	1, 2	ax-mp 5	. . . . . . 7 ⊢ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) = (𝑊 ↾ dom 𝑆)
4	3	breq1i 5156	. . . . . 6 ⊢ (((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ↔ (𝑊 ↾ dom 𝑆) <s 𝑆)
5	4	notbii 319	. . . . 5 ⊢ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆)
6		ssun2 4171	. . . . . . . 8 ⊢ dom 𝑇 ⊆ (dom 𝑆 ∪ dom 𝑇)
7		resabs1 6012	. . . . . . . 8 ⊢ (dom 𝑇 ⊆ (dom 𝑆 ∪ dom 𝑇) → ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) = (𝑊 ↾ dom 𝑇))
8	6, 7	ax-mp 5	. . . . . . 7 ⊢ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) = (𝑊 ↾ dom 𝑇)
9	8	breq2i 5157	. . . . . 6 ⊢ (𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) ↔ 𝑇 <s (𝑊 ↾ dom 𝑇))
10	9	notbii 319	. . . . 5 ⊢ (¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))
11	5, 10	anbi12i 626	. . . 4 ⊢ ((¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)) ↔ (¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
12	11	bicomi 223	. . 3 ⊢ ((¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)) ↔ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)))
13	12	a1i 11	. 2 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → ((¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)) ↔ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇))))
14		simp1l 1194	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → 𝐴 ⊆ No )
15		simp1r 1195	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → 𝐴 ∈ V)
16		simp3 1135	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → 𝑊 ∈ No )
17		nosupinfsep.1	. . . . 5 ⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
18	17	nosupbnd2 27695	. . . 4 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V ∧ 𝑊 ∈ No ) → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑊 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆))
19	14, 15, 16, 18	syl3anc 1368	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑊 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆))
20		simp2l 1196	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → 𝐵 ⊆ No )
21		simp2r 1197	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → 𝐵 ∈ V)
22		nosupinfsep.2	. . . . 5 ⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
23	22	noinfbnd2 27710	. . . 4 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ V ∧ 𝑊 ∈ No ) → (∀𝑏 ∈ 𝐵 𝑊 <s 𝑏 ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
24	20, 21, 16, 23	syl3anc 1368	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → (∀𝑏 ∈ 𝐵 𝑊 <s 𝑏 ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
25	19, 24	anbi12d 630	. 2 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑊 ∧ ∀𝑏 ∈ 𝐵 𝑊 <s 𝑏) ↔ (¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))))
26	17	nosupno 27682	. . . . . . . 8 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V) → 𝑆 ∈ No )
27		nodmon 27629	. . . . . . . 8 ⊢ (𝑆 ∈ No → dom 𝑆 ∈ On)
28	26, 27	syl 17	. . . . . . 7 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V) → dom 𝑆 ∈ On)
29	28	3ad2ant1 1130	. . . . . 6 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → dom 𝑆 ∈ On)
30	22	noinfno 27697	. . . . . . . 8 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑇 ∈ No )
31		nodmon 27629	. . . . . . . 8 ⊢ (𝑇 ∈ No → dom 𝑇 ∈ On)
32	30, 31	syl 17	. . . . . . 7 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ V) → dom 𝑇 ∈ On)
33	32	3ad2ant2 1131	. . . . . 6 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → dom 𝑇 ∈ On)
34		onun2 6479	. . . . . 6 ⊢ ((dom 𝑆 ∈ On ∧ dom 𝑇 ∈ On) → (dom 𝑆 ∪ dom 𝑇) ∈ On)
35	29, 33, 34	syl2anc 582	. . . . 5 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → (dom 𝑆 ∪ dom 𝑇) ∈ On)
36		noreson 27639	. . . . 5 ⊢ ((𝑊 ∈ No ∧ (dom 𝑆 ∪ dom 𝑇) ∈ On) → (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No )
37	16, 35, 36	syl2anc 582	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No )
38	17	nosupbnd2 27695	. . . 4 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ) → (∀𝑎 ∈ 𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↔ ¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆))
39	14, 15, 37, 38	syl3anc 1368	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → (∀𝑎 ∈ 𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↔ ¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆))
40	20, 21, 37	3jca 1125	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → (𝐵 ⊆ No ∧ 𝐵 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ))
41	22	noinfbnd2 27710	. . . 4 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ) → (∀𝑏 ∈ 𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏 ↔ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)))
42	40, 41	syl 17	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → (∀𝑏 ∈ 𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏 ↔ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)))
43	39, 42	anbi12d 630	. 2 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → ((∀𝑎 ∈ 𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∧ ∀𝑏 ∈ 𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏) ↔ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇))))
44	13, 25, 43	3bitr4d 310	1 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ 𝑊 ∈ No ) → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑊 ∧ ∀𝑏 ∈ 𝐵 𝑊 <s 𝑏) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∧ ∀𝑏 ∈ 𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098  {cab 2702  ∀wral 3050  ∃wrex 3059  Vcvv 3461   ∪ cun 3942   ⊆ wss 3944  ifcif 4530  {csn 4630  ⟨cop 4636   class class class wbr 5149   ↦ cmpt 5232  dom cdm 5678   ↾ cres 5680  Oncon0 6371  suc csuc 6373  ℩cio 6499  ‘cfv 6549  ℩crio 7374  1_oc1o 8480  2_oc2o 8481   No csur 27618   <s cslt 27619

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-rmo 3363  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3964  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-tp 4635  df-op 4637  df-uni 4910  df-int 4951  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-ord 6374  df-on 6375  df-suc 6377  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-riota 7375  df-1o 8487  df-2o 8488  df-no 27621  df-slt 27622  df-bday 27623

This theorem is referenced by:  noetalem1  27720