Theorem sltmuls1 28538

Description: One surreal set less-than relationship for cuts of 𝐴 and 𝐵. (Contributed by Scott Fenton, 7-Mar-2025.)

Hypotheses

Ref	Expression
sltmuls1.1	⊢ (𝜑 → 𝐿 <<s 𝑅)
sltmuls1.2	⊢ (𝜑 → 𝑀 <<s 𝑆)
sltmuls1.3	⊢ (𝜑 → 𝐴 = (𝐿 |s 𝑅))
sltmuls1.4	⊢ (𝜑 → 𝐵 = (𝑀 |s 𝑆))

Assertion

Ref	Expression
sltmuls1	⊢ (𝜑 → ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) <<s {(𝐴 ·s 𝐵)})

Distinct variable groups:   𝐴,𝑎   𝐴,𝑏   𝐴,𝑝,𝑞   𝐴,𝑟,𝑠   𝐵,𝑎   𝐵,𝑏   𝐵,𝑝,𝑞   𝐵,𝑟,𝑠   𝐿,𝑎,𝑝,𝑞   𝑀,𝑎,𝑝,𝑞   𝑅,𝑏,𝑟,𝑠   𝑆,𝑏,𝑟,𝑠   𝜑,𝑝,𝑎,𝑞   𝜑,𝑏,𝑟,𝑠

Allowed substitution hints:   𝑅(𝑞, 𝑝, 𝑎)   𝑆(𝑞, 𝑝, 𝑎)   𝐿(𝑠, 𝑟, 𝑏)   𝑀(𝑠, 𝑟, 𝑏)

Proof of Theorem sltmuls1

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2760	. . . . 5 ⊢ (𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))) = (𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)))
2	1	rnmpo 7553	. . . 4 ⊢ ran (𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))) = {𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))}
3		sltmuls1.1	. . . . . . 7 ⊢ (𝜑 → 𝐿 <<s 𝑅)
4		sltsex1 28154	. . . . . . 7 ⊢ (𝐿 <<s 𝑅 → 𝐿 ∈ V)
5	3, 4	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ V)
6		sltmuls1.2	. . . . . . 7 ⊢ (𝜑 → 𝑀 <<s 𝑆)
7		sltsex1 28154	. . . . . . 7 ⊢ (𝑀 <<s 𝑆 → 𝑀 ∈ V)
8	6, 7	syl 18	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ V)
9	1	mpoexg 8089	. . . . . 6 ⊢ ((𝐿 ∈ V ∧ 𝑀 ∈ V) → (𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))) ∈ V)
10	5, 8, 9	syl2anc 596	. . . . 5 ⊢ (𝜑 → (𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))) ∈ V)
11		rnexg 7914	. . . . 5 ⊢ ((𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))) ∈ V → ran (𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))) ∈ V)
12	10, 11	syl 18	. . . 4 ⊢ (𝜑 → ran (𝑝 ∈ 𝐿, 𝑞 ∈ 𝑀 ↦ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))) ∈ V)
13	2, 12	eqeltrrid 2865	. . 3 ⊢ (𝜑 → {𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∈ V)
14		eqid 2760	. . . . 5 ⊢ (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) = (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)))
15	14	rnmpo 7553	. . . 4 ⊢ ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) = {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}
16		sltsex2 28155	. . . . . . 7 ⊢ (𝐿 <<s 𝑅 → 𝑅 ∈ V)
17	3, 16	syl 18	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ V)
18		sltsex2 28155	. . . . . . 7 ⊢ (𝑀 <<s 𝑆 → 𝑆 ∈ V)
19	6, 18	syl 18	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ V)
20	14	mpoexg 8089	. . . . . 6 ⊢ ((𝑅 ∈ V ∧ 𝑆 ∈ V) → (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) ∈ V)
21	17, 19, 20	syl2anc 596	. . . . 5 ⊢ (𝜑 → (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) ∈ V)
22		rnexg 7914	. . . . 5 ⊢ ((𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) ∈ V → ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) ∈ V)
23	21, 22	syl 18	. . . 4 ⊢ (𝜑 → ran (𝑟 ∈ 𝑅, 𝑠 ∈ 𝑆 ↦ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) ∈ V)
24	15, 23	eqeltrrid 2865	. . 3 ⊢ (𝜑 → {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))} ∈ V)
25	13, 24	unexd 7768	. 2 ⊢ (𝜑 → ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) ∈ V)
26		snex 5396	. . 3 ⊢ {(𝐴 ·s 𝐵)} ∈ V
27	26	a1i 11	. 2 ⊢ (𝜑 → {(𝐴 ·s 𝐵)} ∈ V)
28		sltsss1 28156	. . . . . . . . . . . 12 ⊢ (𝐿 <<s 𝑅 → 𝐿 ⊆ No)
29	3, 28	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐿 ⊆ No)
30	29	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝐿 ⊆ No)
31		simprl 783	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑝 ∈ 𝐿)
32	30, 31	sseldd 3909	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑝 ∈ No)
33		sltmuls1.4	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (𝑀 |s 𝑆))
34	6	cutscld 28174	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀 |s 𝑆) ∈ No)
35	33, 34	eqeltrd 2860	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ No)
36	35	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝐵 ∈ No)
37	32, 36	mulscld 28526	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (𝑝 ·s 𝐵) ∈ No)
38		sltmuls1.3	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 = (𝐿 |s 𝑅))
39	3	cutscld 28174	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐿 |s 𝑅) ∈ No)
40	38, 39	eqeltrd 2860	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ No)
41	40	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝐴 ∈ No)
42		sltsss1 28156	. . . . . . . . . . . 12 ⊢ (𝑀 <<s 𝑆 → 𝑀 ⊆ No)
43	6, 42	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ⊆ No)
44	43	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑀 ⊆ No)
45		simprr 785	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑞 ∈ 𝑀)
46	44, 45	sseldd 3909	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑞 ∈ No)
47	41, 46	mulscld 28526	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (𝐴 ·s 𝑞) ∈ No)
48	37, 47	addscld 28371	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → ((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) ∈ No)
49	32, 46	mulscld 28526	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (𝑝 ·s 𝑞) ∈ No)
50	48, 49	subscld 28454	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) ∈ No)
51		eleq1 2848	. . . . . 6 ⊢ (𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) → (𝑎 ∈ No ↔ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) ∈ No))
52	50, 51	syl5ibrcom 250	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) → 𝑎 ∈ No))
53	52	rexlimdvva 3219	. . . 4 ⊢ (𝜑 → (∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) → 𝑎 ∈ No))
54	53	abssdv 3992	. . 3 ⊢ (𝜑 → {𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ⊆ No)
55		sltsss2 28157	. . . . . . . . . . . 12 ⊢ (𝐿 <<s 𝑅 → 𝑅 ⊆ No)
56	3, 55	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ⊆ No)
57	56	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑅 ⊆ No)
58		simprl 783	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑟 ∈ 𝑅)
59	57, 58	sseldd 3909	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑟 ∈ No)
60	35	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐵 ∈ No)
61	59, 60	mulscld 28526	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑟 ·s 𝐵) ∈ No)
62	40	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐴 ∈ No)
63		sltsss2 28157	. . . . . . . . . . . 12 ⊢ (𝑀 <<s 𝑆 → 𝑆 ⊆ No)
64	6, 63	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ⊆ No)
65	64	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑆 ⊆ No)
66		simprr 785	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑠 ∈ 𝑆)
67	65, 66	sseldd 3909	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑠 ∈ No)
68	62, 67	mulscld 28526	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝐴 ·s 𝑠) ∈ No)
69	61, 68	addscld 28371	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) ∈ No)
70	59, 67	mulscld 28526	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑟 ·s 𝑠) ∈ No)
71	69, 70	subscld 28454	. . . . . 6 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) ∈ No)
72		eleq1 2848	. . . . . 6 ⊢ (𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) → (𝑏 ∈ No ↔ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) ∈ No))
73	71, 72	syl5ibrcom 250	. . . . 5 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) → 𝑏 ∈ No))
74	73	rexlimdvva 3219	. . . 4 ⊢ (𝜑 → (∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) → 𝑏 ∈ No))
75	74	abssdv 3992	. . 3 ⊢ (𝜑 → {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))} ⊆ No)
76	54, 75	unssd 4190	. 2 ⊢ (𝜑 → ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) ⊆ No)
77	40, 35	mulscld 28526	. . 3 ⊢ (𝜑 → (𝐴 ·s 𝐵) ∈ No)
78	77	snssd 4743	. 2 ⊢ (𝜑 → {(𝐴 ·s 𝐵)} ⊆ No)
79		elun 4152	. . . . . . 7 ⊢ (𝑥 ∈ ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) ↔ (𝑥 ∈ {𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∨ 𝑥 ∈ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}))
80		vex 3454	. . . . . . . . 9 ⊢ 𝑥 ∈ V
81		eqeq1 2764	. . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) ↔ 𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))))
82	81	2rexbidv 3227	. . . . . . . . 9 ⊢ (𝑎 = 𝑥 → (∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) ↔ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))))
83	80, 82	elab 3632	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ↔ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)))
84		eqeq1 2764	. . . . . . . . . 10 ⊢ (𝑏 = 𝑥 → (𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) ↔ 𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))))
85	84	2rexbidv 3227	. . . . . . . . 9 ⊢ (𝑏 = 𝑥 → (∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))))
86	80, 85	elab 3632	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))} ↔ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)))
87	83, 86	orbi12i 928	. . . . . . 7 ⊢ ((𝑥 ∈ {𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∨ 𝑥 ∈ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) ↔ (∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) ∨ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))))
88	79, 87	bitri 278	. . . . . 6 ⊢ (𝑥 ∈ ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) ↔ (∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) ∨ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))))
89	37, 47, 49	addsubsd 28473	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) = (((𝑝 ·s 𝐵) −s (𝑝 ·s 𝑞)) +s (𝐴 ·s 𝑞)))
90		cutcuts 28172	. . . . . . . . . . . . . . . 16 ⊢ (𝐿 <<s 𝑅 → ((𝐿 |s 𝑅) ∈ No ∧ 𝐿 <<s {(𝐿 |s 𝑅)} ∧ {(𝐿 |s 𝑅)} <<s 𝑅))
91	3, 90	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝐿 |s 𝑅) ∈ No ∧ 𝐿 <<s {(𝐿 |s 𝑅)} ∧ {(𝐿 |s 𝑅)} <<s 𝑅))
92	91	simp2d 1161	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐿 <<s {(𝐿 |s 𝑅)})
93	92	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝐿 <<s {(𝐿 |s 𝑅)})
94		ovex 7453	. . . . . . . . . . . . . . . 16 ⊢ (𝐿 |s 𝑅) ∈ V
95	94	snid 4619	. . . . . . . . . . . . . . 15 ⊢ (𝐿 |s 𝑅) ∈ {(𝐿 |s 𝑅)}
96	38, 95	eqeltrdi 2868	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ∈ {(𝐿 |s 𝑅)})
97	96	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝐴 ∈ {(𝐿 |s 𝑅)})
98	93, 31, 97	sltssepcd 28163	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑝 <s 𝐴)
99		cutcuts 28172	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 <<s 𝑆 → ((𝑀 |s 𝑆) ∈ No ∧ 𝑀 <<s {(𝑀 |s 𝑆)} ∧ {(𝑀 |s 𝑆)} <<s 𝑆))
100	6, 99	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑀 |s 𝑆) ∈ No ∧ 𝑀 <<s {(𝑀 |s 𝑆)} ∧ {(𝑀 |s 𝑆)} <<s 𝑆))
101	100	simp2d 1161	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 <<s {(𝑀 |s 𝑆)})
102	101	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑀 <<s {(𝑀 |s 𝑆)})
103		ovex 7453	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 |s 𝑆) ∈ V
104	103	snid 4619	. . . . . . . . . . . . . . 15 ⊢ (𝑀 |s 𝑆) ∈ {(𝑀 |s 𝑆)}
105	33, 104	eqeltrdi 2868	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ {(𝑀 |s 𝑆)})
106	105	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝐵 ∈ {(𝑀 |s 𝑆)})
107	102, 45, 106	sltssepcd 28163	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → 𝑞 <s 𝐵)
108	32, 41, 46, 36, 98, 107	ltmulsd 28528	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → ((𝑝 ·s 𝐵) −s (𝑝 ·s 𝑞)) <s ((𝐴 ·s 𝐵) −s (𝐴 ·s 𝑞)))
109	37, 49	subscld 28454	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → ((𝑝 ·s 𝐵) −s (𝑝 ·s 𝑞)) ∈ No)
110	77	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (𝐴 ·s 𝐵) ∈ No)
111	109, 47, 110	ltaddsubsd 28482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → ((((𝑝 ·s 𝐵) −s (𝑝 ·s 𝑞)) +s (𝐴 ·s 𝑞)) <s (𝐴 ·s 𝐵) ↔ ((𝑝 ·s 𝐵) −s (𝑝 ·s 𝑞)) <s ((𝐴 ·s 𝐵) −s (𝐴 ·s 𝑞))))
112	108, 111	mpbird 260	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (((𝑝 ·s 𝐵) −s (𝑝 ·s 𝑞)) +s (𝐴 ·s 𝑞)) <s (𝐴 ·s 𝐵))
113	89, 112	eqbrtrd 5126	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) <s (𝐴 ·s 𝐵))
114		breq1 5105	. . . . . . . . 9 ⊢ (𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) → (𝑥 <s (𝐴 ·s 𝐵) ↔ (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) <s (𝐴 ·s 𝐵)))
115	113, 114	syl5ibrcom 250	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝐿 ∧ 𝑞 ∈ 𝑀)) → (𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) → 𝑥 <s (𝐴 ·s 𝐵)))
116	115	rexlimdvva 3219	. . . . . . 7 ⊢ (𝜑 → (∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) → 𝑥 <s (𝐴 ·s 𝐵)))
117	61, 68, 70	addsubsd 28473	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) = (((𝑟 ·s 𝐵) −s (𝑟 ·s 𝑠)) +s (𝐴 ·s 𝑠)))
118	3	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐿 <<s 𝑅)
119	118, 90	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((𝐿 |s 𝑅) ∈ No ∧ 𝐿 <<s {(𝐿 |s 𝑅)} ∧ {(𝐿 |s 𝑅)} <<s 𝑅))
120	119	simp3d 1162	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → {(𝐿 |s 𝑅)} <<s 𝑅)
121	38	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐴 = (𝐿 |s 𝑅))
122	121, 95	eqeltrdi 2868	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐴 ∈ {(𝐿 |s 𝑅)})
123	120, 122, 58	sltssepcd 28163	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐴 <s 𝑟)
124	6	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝑀 <<s 𝑆)
125	124, 99	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((𝑀 |s 𝑆) ∈ No ∧ 𝑀 <<s {(𝑀 |s 𝑆)} ∧ {(𝑀 |s 𝑆)} <<s 𝑆))
126	125	simp3d 1162	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → {(𝑀 |s 𝑆)} <<s 𝑆)
127	33	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐵 = (𝑀 |s 𝑆))
128	127, 104	eqeltrdi 2868	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐵 ∈ {(𝑀 |s 𝑆)})
129	126, 128, 66	sltssepcd 28163	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → 𝐵 <s 𝑠)
130	62, 59, 60, 67, 123, 129	ltmulsd 28528	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((𝐴 ·s 𝑠) −s (𝐴 ·s 𝐵)) <s ((𝑟 ·s 𝑠) −s (𝑟 ·s 𝐵)))
131	61, 70	subscld 28454	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((𝑟 ·s 𝐵) −s (𝑟 ·s 𝑠)) ∈ No)
132	77	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝐴 ·s 𝐵) ∈ No)
133	131, 68, 132	ltaddsubsd 28482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((((𝑟 ·s 𝐵) −s (𝑟 ·s 𝑠)) +s (𝐴 ·s 𝑠)) <s (𝐴 ·s 𝐵) ↔ ((𝑟 ·s 𝐵) −s (𝑟 ·s 𝑠)) <s ((𝐴 ·s 𝐵) −s (𝐴 ·s 𝑠))))
134	61, 70, 132, 68	ltsubsubs2bd 28475	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (((𝑟 ·s 𝐵) −s (𝑟 ·s 𝑠)) <s ((𝐴 ·s 𝐵) −s (𝐴 ·s 𝑠)) ↔ ((𝐴 ·s 𝑠) −s (𝐴 ·s 𝐵)) <s ((𝑟 ·s 𝑠) −s (𝑟 ·s 𝐵))))
135	133, 134	bitrd 282	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → ((((𝑟 ·s 𝐵) −s (𝑟 ·s 𝑠)) +s (𝐴 ·s 𝑠)) <s (𝐴 ·s 𝐵) ↔ ((𝐴 ·s 𝑠) −s (𝐴 ·s 𝐵)) <s ((𝑟 ·s 𝑠) −s (𝑟 ·s 𝐵))))
136	130, 135	mpbird 260	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (((𝑟 ·s 𝐵) −s (𝑟 ·s 𝑠)) +s (𝐴 ·s 𝑠)) <s (𝐴 ·s 𝐵))
137	117, 136	eqbrtrd 5126	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) <s (𝐴 ·s 𝐵))
138		breq1 5105	. . . . . . . . 9 ⊢ (𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) → (𝑥 <s (𝐴 ·s 𝐵) ↔ (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) <s (𝐴 ·s 𝐵)))
139	137, 138	syl5ibrcom 250	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑅 ∧ 𝑠 ∈ 𝑆)) → (𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) → 𝑥 <s (𝐴 ·s 𝐵)))
140	139	rexlimdvva 3219	. . . . . . 7 ⊢ (𝜑 → (∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠)) → 𝑥 <s (𝐴 ·s 𝐵)))
141	116, 140	jaod 873	. . . . . 6 ⊢ (𝜑 → ((∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑥 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞)) ∨ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑥 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))) → 𝑥 <s (𝐴 ·s 𝐵)))
142	88, 141	biimtrid 245	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) → 𝑥 <s (𝐴 ·s 𝐵)))
143	142	imp 412	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))})) → 𝑥 <s (𝐴 ·s 𝐵))
144		velsn 4596	. . . . 5 ⊢ (𝑦 ∈ {(𝐴 ·s 𝐵)} ↔ 𝑦 = (𝐴 ·s 𝐵))
145		breq2 5106	. . . . 5 ⊢ (𝑦 = (𝐴 ·s 𝐵) → (𝑥 <s 𝑦 ↔ 𝑥 <s (𝐴 ·s 𝐵)))
146	144, 145	sylbi 220	. . . 4 ⊢ (𝑦 ∈ {(𝐴 ·s 𝐵)} → (𝑥 <s 𝑦 ↔ 𝑥 <s (𝐴 ·s 𝐵)))
147	143, 146	syl5ibrcom 250	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))})) → (𝑦 ∈ {(𝐴 ·s 𝐵)} → 𝑥 <s 𝑦))
148	147	3impia 1135	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) ∧ 𝑦 ∈ {(𝐴 ·s 𝐵)}) → 𝑥 <s 𝑦)
149	25, 27, 76, 78, 148	sltsd 28159	1 ⊢ (𝜑 → ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) −s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) −s (𝑟 ·s 𝑠))}) <<s {(𝐴 ·s 𝐵)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  {cab 2738  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895   ∪ cun 4149  {csn 4584   class class class wbr 5102  ran crn 5651  (class class class)co 7420   ∈ cmpo 7422  Nocsur 28002   <s clts 28003   <<s cslts 28148   |s ccuts 28150   +_s cadds 28350   −_s csubs 28411   ·_s cmuls 28497

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-ot 4858  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-1o 8479  df-2o 8480  df-nadd 8678  df-no 28005  df-lts 28006  df-bday 28007  df-les 28107  df-slts 28149  df-cuts 28151  df-0s 28198  df-made 28218  df-old 28219  df-left 28221  df-right 28222  df-norec 28329  df-norec2 28340  df-adds 28351  df-negs 28412  df-subs 28413  df-muls 28498

This theorem is used by:  mulsuniflem  28540