Theorem addsasslem2 28395

Description: Lemma for addition associativity. Expand the other form of the triple sum. (Contributed by Scott Fenton, 21-Jan-2025.)

Hypotheses

Ref	Expression
addsasslem.1	⊢ (𝜑 → 𝐴 ∈ No)
addsasslem.2	⊢ (𝜑 → 𝐵 ∈ No)
addsasslem.3	⊢ (𝜑 → 𝐶 ∈ No)

Assertion

Ref	Expression
addsasslem2	⊢ (𝜑 → (𝐴 +s (𝐵 +s 𝐶)) = ((({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}) |s (({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})))

Distinct variable groups:   𝐴,𝑎,𝑏,𝑐,𝑙,𝑚,𝑛,𝑝,𝑞,𝑟,𝑤,𝑦,𝑧   𝐵,𝑎,𝑏,𝑐,𝑙,𝑚,𝑛,𝑝,𝑞,𝑟,𝑤,𝑦,𝑧   𝐶,𝑎,𝑏,𝑐,𝑙,𝑚,𝑛,𝑝,𝑞,𝑟,𝑤,𝑦,𝑧   𝜑,𝑎,𝑏,𝑐,𝑙,𝑚,𝑛,𝑝,𝑞,𝑟,𝑤,𝑦,𝑧

Proof of Theorem addsasslem2

Dummy variables 𝑑 𝑒 𝑓 𝑔 ℎ 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lltr 28253	. . . 4 ⊢ (L‘𝐴) <<s (R‘𝐴)
2	1	a1i 11	. . 3 ⊢ (𝜑 → (L‘𝐴) <<s (R‘𝐴))
3		addsasslem.2	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ No)
4		addsasslem.3	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ No)
5	3, 4	addcuts 28369	. . . . 5 ⊢ (𝜑 → ((𝐵 +s 𝐶) ∈ No ∧ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)} ∧ {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})))
6	5	simp2d 1161	. . . 4 ⊢ (𝜑 → ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)})
7	5	simp3d 1162	. . . 4 ⊢ (𝜑 → {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
8		ovex 7453	. . . . . 6 ⊢ (𝐵 +s 𝐶) ∈ V
9	8	snnz 4733	. . . . 5 ⊢ {(𝐵 +s 𝐶)} ≠ ∅
10		sltstr 28178	. . . . 5 ⊢ ((({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)} ∧ {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}) ∧ {(𝐵 +s 𝐶)} ≠ ∅) → ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
11	9, 10	mp3an3 1479	. . . 4 ⊢ ((({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)} ∧ {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})) → ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
12	6, 7, 11	syl2anc 596	. . 3 ⊢ (𝜑 → ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
13		addsasslem.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ No)
14		lrcut 28295	. . . . 5 ⊢ (𝐴 ∈ No → ((L‘𝐴) |s (R‘𝐴)) = 𝐴)
15	13, 14	syl 18	. . . 4 ⊢ (𝜑 → ((L‘𝐴) |s (R‘𝐴)) = 𝐴)
16	15	eqcomd 2766	. . 3 ⊢ (𝜑 → 𝐴 = ((L‘𝐴) |s (R‘𝐴)))
17		addsval2 28354	. . . 4 ⊢ ((𝐵 ∈ No ∧ 𝐶 ∈ No) → (𝐵 +s 𝐶) = (({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) |s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})))
18	3, 4, 17	syl2anc 596	. . 3 ⊢ (𝜑 → (𝐵 +s 𝐶) = (({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}) |s ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})))
19	2, 12, 16, 18	addsunif 28393	. 2 ⊢ (𝜑 → (𝐴 +s (𝐵 +s 𝐶)) = (({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ)}) |s ({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)})))
20		rexun 4194	. . . . . . . 8 ⊢ (∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ) ↔ (∃ℎ ∈ {𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ℎ) ∨ ∃ℎ ∈ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s ℎ)))
21		eqeq1 2764	. . . . . . . . . . . 12 ⊢ (𝑑 = ℎ → (𝑑 = (𝑚 +s 𝐶) ↔ ℎ = (𝑚 +s 𝐶)))
22	21	rexbidv 3186	. . . . . . . . . . 11 ⊢ (𝑑 = ℎ → (∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶) ↔ ∃𝑚 ∈ (L‘𝐵)ℎ = (𝑚 +s 𝐶)))
23	22	rexab 3652	. . . . . . . . . 10 ⊢ (∃ℎ ∈ {𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ℎ) ↔ ∃ℎ(∃𝑚 ∈ (L‘𝐵)ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)))
24		rexcom4 3289	. . . . . . . . . . 11 ⊢ (∃𝑚 ∈ (L‘𝐵)∃ℎ(ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃ℎ∃𝑚 ∈ (L‘𝐵)(ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)))
25		ovex 7453	. . . . . . . . . . . . 13 ⊢ (𝑚 +s 𝐶) ∈ V
26		oveq2 7428	. . . . . . . . . . . . . 14 ⊢ (ℎ = (𝑚 +s 𝐶) → (𝐴 +s ℎ) = (𝐴 +s (𝑚 +s 𝐶)))
27	26	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (ℎ = (𝑚 +s 𝐶) → (𝑧 = (𝐴 +s ℎ) ↔ 𝑧 = (𝐴 +s (𝑚 +s 𝐶))))
28	25, 27	ceqsexv 3498	. . . . . . . . . . . 12 ⊢ (∃ℎ(ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ 𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
29	28	rexbii 3109	. . . . . . . . . . 11 ⊢ (∃𝑚 ∈ (L‘𝐵)∃ℎ(ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
30		r19.41v 3192	. . . . . . . . . . . 12 ⊢ (∃𝑚 ∈ (L‘𝐵)(ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ (∃𝑚 ∈ (L‘𝐵)ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)))
31	30	exbii 1880	. . . . . . . . . . 11 ⊢ (∃ℎ∃𝑚 ∈ (L‘𝐵)(ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃ℎ(∃𝑚 ∈ (L‘𝐵)ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)))
32	24, 29, 31	3bitr3ri 305	. . . . . . . . . 10 ⊢ (∃ℎ(∃𝑚 ∈ (L‘𝐵)ℎ = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
33	23, 32	bitri 278	. . . . . . . . 9 ⊢ (∃ℎ ∈ {𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ℎ) ↔ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
34		eqeq1 2764	. . . . . . . . . . . 12 ⊢ (𝑒 = ℎ → (𝑒 = (𝐵 +s 𝑛) ↔ ℎ = (𝐵 +s 𝑛)))
35	34	rexbidv 3186	. . . . . . . . . . 11 ⊢ (𝑒 = ℎ → (∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛) ↔ ∃𝑛 ∈ (L‘𝐶)ℎ = (𝐵 +s 𝑛)))
36	35	rexab 3652	. . . . . . . . . 10 ⊢ (∃ℎ ∈ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s ℎ) ↔ ∃ℎ(∃𝑛 ∈ (L‘𝐶)ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)))
37		rexcom4 3289	. . . . . . . . . . 11 ⊢ (∃𝑛 ∈ (L‘𝐶)∃ℎ(ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃ℎ∃𝑛 ∈ (L‘𝐶)(ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)))
38		ovex 7453	. . . . . . . . . . . . 13 ⊢ (𝐵 +s 𝑛) ∈ V
39		oveq2 7428	. . . . . . . . . . . . . 14 ⊢ (ℎ = (𝐵 +s 𝑛) → (𝐴 +s ℎ) = (𝐴 +s (𝐵 +s 𝑛)))
40	39	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (ℎ = (𝐵 +s 𝑛) → (𝑧 = (𝐴 +s ℎ) ↔ 𝑧 = (𝐴 +s (𝐵 +s 𝑛))))
41	38, 40	ceqsexv 3498	. . . . . . . . . . . 12 ⊢ (∃ℎ(ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ 𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
42	41	rexbii 3109	. . . . . . . . . . 11 ⊢ (∃𝑛 ∈ (L‘𝐶)∃ℎ(ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
43		r19.41v 3192	. . . . . . . . . . . 12 ⊢ (∃𝑛 ∈ (L‘𝐶)(ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ (∃𝑛 ∈ (L‘𝐶)ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)))
44	43	exbii 1880	. . . . . . . . . . 11 ⊢ (∃ℎ∃𝑛 ∈ (L‘𝐶)(ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃ℎ(∃𝑛 ∈ (L‘𝐶)ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)))
45	37, 42, 44	3bitr3ri 305	. . . . . . . . . 10 ⊢ (∃ℎ(∃𝑛 ∈ (L‘𝐶)ℎ = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s ℎ)) ↔ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
46	36, 45	bitri 278	. . . . . . . . 9 ⊢ (∃ℎ ∈ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s ℎ) ↔ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
47	33, 46	orbi12i 928	. . . . . . . 8 ⊢ ((∃ℎ ∈ {𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ℎ) ∨ ∃ℎ ∈ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s ℎ)) ↔ (∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))))
48	20, 47	bitri 278	. . . . . . 7 ⊢ (∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ) ↔ (∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))))
49	48	abbii 2827	. . . . . 6 ⊢ {𝑧 ∣ ∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ)} = {𝑧 ∣ (∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))}
50		unab 4253	. . . . . 6 ⊢ ({𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))}) = {𝑧 ∣ (∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))}
51		eqeq1 2764	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → (𝑧 = (𝐴 +s (𝐵 +s 𝑛)) ↔ 𝑤 = (𝐴 +s (𝐵 +s 𝑛))))
52	51	rexbidv 3186	. . . . . . . 8 ⊢ (𝑧 = 𝑤 → (∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)) ↔ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))))
53	52	cbvabv 2830	. . . . . . 7 ⊢ {𝑧 ∣ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))} = {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}
54	53	uneq2i 4164	. . . . . 6 ⊢ ({𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑛 ∈ (L‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))}) = ({𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))})
55	49, 50, 54	3eqtr2i 2789	. . . . 5 ⊢ {𝑧 ∣ ∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ)} = ({𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))})
56	55	uneq2i 4164	. . . 4 ⊢ ({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ)}) = ({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ ({𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}))
57		unass 4170	. . . 4 ⊢ (({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}) = ({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ ({𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}))
58	56, 57	eqtr4i 2786	. . 3 ⊢ ({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ)}) = (({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))})
59		rexun 4194	. . . . . . . 8 ⊢ (∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖) ↔ (∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ∨ ∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖)))
60		eqeq1 2764	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑖 → (𝑓 = (𝑞 +s 𝐶) ↔ 𝑖 = (𝑞 +s 𝐶)))
61	60	rexbidv 3186	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑖 → (∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶) ↔ ∃𝑞 ∈ (R‘𝐵)𝑖 = (𝑞 +s 𝐶)))
62	61	rexab 3652	. . . . . . . . . 10 ⊢ (∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑖(∃𝑞 ∈ (R‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
63		rexcom4 3289	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ (R‘𝐵)∃𝑖(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖∃𝑞 ∈ (R‘𝐵)(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
64		ovex 7453	. . . . . . . . . . . . 13 ⊢ (𝑞 +s 𝐶) ∈ V
65		oveq2 7428	. . . . . . . . . . . . . 14 ⊢ (𝑖 = (𝑞 +s 𝐶) → (𝐴 +s 𝑖) = (𝐴 +s (𝑞 +s 𝐶)))
66	65	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝑞 +s 𝐶) → (𝑏 = (𝐴 +s 𝑖) ↔ 𝑏 = (𝐴 +s (𝑞 +s 𝐶))))
67	64, 66	ceqsexv 3498	. . . . . . . . . . . 12 ⊢ (∃𝑖(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ 𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
68	67	rexbii 3109	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ (R‘𝐵)∃𝑖(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
69		r19.41v 3192	. . . . . . . . . . . 12 ⊢ (∃𝑞 ∈ (R‘𝐵)(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ (∃𝑞 ∈ (R‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
70	69	exbii 1880	. . . . . . . . . . 11 ⊢ (∃𝑖∃𝑞 ∈ (R‘𝐵)(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖(∃𝑞 ∈ (R‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
71	63, 68, 70	3bitr3ri 305	. . . . . . . . . 10 ⊢ (∃𝑖(∃𝑞 ∈ (R‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
72	62, 71	bitri 278	. . . . . . . . 9 ⊢ (∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
73		eqeq1 2764	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑖 → (𝑔 = (𝐵 +s 𝑟) ↔ 𝑖 = (𝐵 +s 𝑟)))
74	73	rexbidv 3186	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑖 → (∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟) ↔ ∃𝑟 ∈ (R‘𝐶)𝑖 = (𝐵 +s 𝑟)))
75	74	rexab 3652	. . . . . . . . . 10 ⊢ (∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑖(∃𝑟 ∈ (R‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
76		rexcom4 3289	. . . . . . . . . . 11 ⊢ (∃𝑟 ∈ (R‘𝐶)∃𝑖(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖∃𝑟 ∈ (R‘𝐶)(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
77		ovex 7453	. . . . . . . . . . . . 13 ⊢ (𝐵 +s 𝑟) ∈ V
78		oveq2 7428	. . . . . . . . . . . . . 14 ⊢ (𝑖 = (𝐵 +s 𝑟) → (𝐴 +s 𝑖) = (𝐴 +s (𝐵 +s 𝑟)))
79	78	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝐵 +s 𝑟) → (𝑏 = (𝐴 +s 𝑖) ↔ 𝑏 = (𝐴 +s (𝐵 +s 𝑟))))
80	77, 79	ceqsexv 3498	. . . . . . . . . . . 12 ⊢ (∃𝑖(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ 𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
81	80	rexbii 3109	. . . . . . . . . . 11 ⊢ (∃𝑟 ∈ (R‘𝐶)∃𝑖(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
82		r19.41v 3192	. . . . . . . . . . . 12 ⊢ (∃𝑟 ∈ (R‘𝐶)(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ (∃𝑟 ∈ (R‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
83	82	exbii 1880	. . . . . . . . . . 11 ⊢ (∃𝑖∃𝑟 ∈ (R‘𝐶)(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖(∃𝑟 ∈ (R‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
84	76, 81, 83	3bitr3ri 305	. . . . . . . . . 10 ⊢ (∃𝑖(∃𝑟 ∈ (R‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
85	75, 84	bitri 278	. . . . . . . . 9 ⊢ (∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
86	72, 85	orbi12i 928	. . . . . . . 8 ⊢ ((∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ∨ ∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖)) ↔ (∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))))
87	59, 86	bitri 278	. . . . . . 7 ⊢ (∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖) ↔ (∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))))
88	87	abbii 2827	. . . . . 6 ⊢ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)} = {𝑏 ∣ (∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))}
89		unab 4253	. . . . . 6 ⊢ ({𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))}) = {𝑏 ∣ (∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))}
90		eqeq1 2764	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → (𝑏 = (𝐴 +s (𝐵 +s 𝑟)) ↔ 𝑐 = (𝐴 +s (𝐵 +s 𝑟))))
91	90	rexbidv 3186	. . . . . . . 8 ⊢ (𝑏 = 𝑐 → (∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)) ↔ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))))
92	91	cbvabv 2830	. . . . . . 7 ⊢ {𝑏 ∣ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))} = {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}
93	92	uneq2i 4164	. . . . . 6 ⊢ ({𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑟 ∈ (R‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))}) = ({𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})
94	88, 89, 93	3eqtr2i 2789	. . . . 5 ⊢ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)} = ({𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})
95	94	uneq2i 4164	. . . 4 ⊢ ({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)}) = ({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ ({𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}))
96		unass 4170	. . . 4 ⊢ (({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}) = ({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ ({𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}))
97	95, 96	eqtr4i 2786	. . 3 ⊢ ({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)}) = (({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})
98	58, 97	oveq12i 7432	. 2 ⊢ (({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃ℎ ∈ ({𝑑 ∣ ∃𝑚 ∈ (L‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ (L‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ℎ)}) |s ({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ (R‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ (R‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)})) = ((({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}) |s (({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}))
99	19, 98	eqtrdi 2811	1 ⊢ (𝜑 → (𝐴 +s (𝐵 +s 𝐶)) = ((({𝑦 ∣ ∃𝑙 ∈ (L‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ (L‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ (L‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}) |s (({𝑎 ∣ ∃𝑝 ∈ (R‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ (R‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ (R‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ≠ wne 2955  ∃wrex 3086   ∪ cun 4149  ∅c0 4278  {csn 4584   class class class wbr 5102  ‘cfv 6538  (class class class)co 7420  Nocsur 28002   <<s cslts 28148   |s ccuts 28150  Lcleft 28216  Rcright 28217   +_s cadds 28350

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-norec2 28340  df-adds 28351

This theorem is used by:  addsass  28396