MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  addsasslem2 Structured version   Visualization version   GIF version

Theorem addsasslem2 28021
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.
StepHypRef Expression
1 lltr 27879 . . . 4 ( L ‘𝐴) <<s ( R ‘𝐴)
21a1i 11 . . 3 (𝜑 → ( L ‘𝐴) <<s ( R ‘𝐴))
3 addsasslem.2 . . . . . 6 (𝜑𝐵 No )
4 addsasslem.3 . . . . . 6 (𝜑𝐶 No )
53, 4addcuts 27995 . . . . 5 (𝜑 → ((𝐵 +s 𝐶) ∈ No ∧ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)} ∧ {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})))
65simp2d 1149 . . . 4 (𝜑 → ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)})
75simp3d 1150 . . . 4 (𝜑 → {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
8 ovex 7396 . . . . . 6 (𝐵 +s 𝐶) ∈ V
98snnz 4715 . . . . 5 {(𝐵 +s 𝐶)} ≠ ∅
10 sltstr 27804 . . . . 5 ((({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)} ∧ {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}) ∧ {(𝐵 +s 𝐶)} ≠ ∅) → ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
119, 10mp3an3 1458 . . . 4 ((({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s {(𝐵 +s 𝐶)} ∧ {(𝐵 +s 𝐶)} <<s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})) → ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
126, 7, 11syl2anc 590 . . 3 (𝜑 → ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) <<s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}))
13 addsasslem.1 . . . . 5 (𝜑𝐴 No )
14 lrcut 27921 . . . . 5 (𝐴 No → (( L ‘𝐴) |s ( R ‘𝐴)) = 𝐴)
1513, 14syl 17 . . . 4 (𝜑 → (( L ‘𝐴) |s ( R ‘𝐴)) = 𝐴)
1615eqcomd 2746 . . 3 (𝜑𝐴 = (( L ‘𝐴) |s ( R ‘𝐴)))
17 addsval2 27980 . . . 4 ((𝐵 No 𝐶 No ) → (𝐵 +s 𝐶) = (({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) |s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})))
183, 4, 17syl2anc 590 . . 3 (𝜑 → (𝐵 +s 𝐶) = (({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}) |s ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})))
192, 12, 16, 18addsunif 28019 . 2 (𝜑 → (𝐴 +s (𝐵 +s 𝐶)) = (({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃ ∈ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s )}) |s ({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)})))
20 rexun 4132 . . . . . . . 8 (∃ ∈ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ) ↔ (∃ ∈ {𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ) ∨ ∃ ∈ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s )))
21 eqeq1 2744 . . . . . . . . . . . 12 (𝑑 = → (𝑑 = (𝑚 +s 𝐶) ↔ = (𝑚 +s 𝐶)))
2221rexbidv 3164 . . . . . . . . . . 11 (𝑑 = → (∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶) ↔ ∃𝑚 ∈ ( L ‘𝐵) = (𝑚 +s 𝐶)))
2322rexab 3643 . . . . . . . . . 10 (∃ ∈ {𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ) ↔ ∃(∃𝑚 ∈ ( L ‘𝐵) = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )))
24 rexcom4 3267 . . . . . . . . . . 11 (∃𝑚 ∈ ( L ‘𝐵)∃( = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )) ↔ ∃𝑚 ∈ ( L ‘𝐵)( = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )))
25 ovex 7396 . . . . . . . . . . . . 13 (𝑚 +s 𝐶) ∈ V
26 oveq2 7371 . . . . . . . . . . . . . 14 ( = (𝑚 +s 𝐶) → (𝐴 +s ) = (𝐴 +s (𝑚 +s 𝐶)))
2726eqeq2d 2751 . . . . . . . . . . . . 13 ( = (𝑚 +s 𝐶) → (𝑧 = (𝐴 +s ) ↔ 𝑧 = (𝐴 +s (𝑚 +s 𝐶))))
2825, 27ceqsexv 3481 . . . . . . . . . . . 12 (∃( = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )) ↔ 𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
2928rexbii 3087 . . . . . . . . . . 11 (∃𝑚 ∈ ( L ‘𝐵)∃( = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )) ↔ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
30 r19.41v 3170 . . . . . . . . . . . 12 (∃𝑚 ∈ ( L ‘𝐵)( = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )) ↔ (∃𝑚 ∈ ( L ‘𝐵) = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )))
3130exbii 1855 . . . . . . . . . . 11 (∃𝑚 ∈ ( L ‘𝐵)( = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )) ↔ ∃(∃𝑚 ∈ ( L ‘𝐵) = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )))
3224, 29, 313bitr3ri 303 . . . . . . . . . 10 (∃(∃𝑚 ∈ ( L ‘𝐵) = (𝑚 +s 𝐶) ∧ 𝑧 = (𝐴 +s )) ↔ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
3323, 32bitri 276 . . . . . . . . 9 (∃ ∈ {𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ) ↔ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)))
34 eqeq1 2744 . . . . . . . . . . . 12 (𝑒 = → (𝑒 = (𝐵 +s 𝑛) ↔ = (𝐵 +s 𝑛)))
3534rexbidv 3164 . . . . . . . . . . 11 (𝑒 = → (∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛) ↔ ∃𝑛 ∈ ( L ‘𝐶) = (𝐵 +s 𝑛)))
3635rexab 3643 . . . . . . . . . 10 (∃ ∈ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s ) ↔ ∃(∃𝑛 ∈ ( L ‘𝐶) = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )))
37 rexcom4 3267 . . . . . . . . . . 11 (∃𝑛 ∈ ( L ‘𝐶)∃( = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )) ↔ ∃𝑛 ∈ ( L ‘𝐶)( = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )))
38 ovex 7396 . . . . . . . . . . . . 13 (𝐵 +s 𝑛) ∈ V
39 oveq2 7371 . . . . . . . . . . . . . 14 ( = (𝐵 +s 𝑛) → (𝐴 +s ) = (𝐴 +s (𝐵 +s 𝑛)))
4039eqeq2d 2751 . . . . . . . . . . . . 13 ( = (𝐵 +s 𝑛) → (𝑧 = (𝐴 +s ) ↔ 𝑧 = (𝐴 +s (𝐵 +s 𝑛))))
4138, 40ceqsexv 3481 . . . . . . . . . . . 12 (∃( = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )) ↔ 𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
4241rexbii 3087 . . . . . . . . . . 11 (∃𝑛 ∈ ( L ‘𝐶)∃( = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )) ↔ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
43 r19.41v 3170 . . . . . . . . . . . 12 (∃𝑛 ∈ ( L ‘𝐶)( = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )) ↔ (∃𝑛 ∈ ( L ‘𝐶) = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )))
4443exbii 1855 . . . . . . . . . . 11 (∃𝑛 ∈ ( L ‘𝐶)( = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )) ↔ ∃(∃𝑛 ∈ ( L ‘𝐶) = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )))
4537, 42, 443bitr3ri 303 . . . . . . . . . 10 (∃(∃𝑛 ∈ ( L ‘𝐶) = (𝐵 +s 𝑛) ∧ 𝑧 = (𝐴 +s )) ↔ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
4636, 45bitri 276 . . . . . . . . 9 (∃ ∈ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s ) ↔ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))
4733, 46orbi12i 920 . . . . . . . 8 ((∃ ∈ {𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)}𝑧 = (𝐴 +s ) ∨ ∃ ∈ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)}𝑧 = (𝐴 +s )) ↔ (∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))))
4820, 47bitri 276 . . . . . . 7 (∃ ∈ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s ) ↔ (∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))))
4948abbii 2807 . . . . . 6 {𝑧 ∣ ∃ ∈ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s )} = {𝑧 ∣ (∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))}
50 unab 4243 . . . . . 6 ({𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))}) = {𝑧 ∣ (∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶)) ∨ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)))}
51 eqeq1 2744 . . . . . . . . 9 (𝑧 = 𝑤 → (𝑧 = (𝐴 +s (𝐵 +s 𝑛)) ↔ 𝑤 = (𝐴 +s (𝐵 +s 𝑛))))
5251rexbidv 3164 . . . . . . . 8 (𝑧 = 𝑤 → (∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛)) ↔ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))))
5352cbvabv 2810 . . . . . . 7 {𝑧 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))} = {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}
5453uneq2i 4102 . . . . . 6 ({𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑧 = (𝐴 +s (𝐵 +s 𝑛))}) = ({𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))})
5549, 50, 543eqtr2i 2769 . . . . 5 {𝑧 ∣ ∃ ∈ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s )} = ({𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))})
5655uneq2i 4102 . . . 4 ({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃ ∈ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s )}) = ({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ ({𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}))
57 unass 4108 . . . 4 (({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}) = ({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ ({𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))} ∪ {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}))
5856, 57eqtr4i 2766 . . 3 ({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃ ∈ ({𝑑 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑑 = (𝑚 +s 𝐶)} ∪ {𝑒 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑒 = (𝐵 +s 𝑛)})𝑧 = (𝐴 +s )}) = (({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))})
59 rexun 4132 . . . . . . . 8 (∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖) ↔ (∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ∨ ∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖)))
60 eqeq1 2744 . . . . . . . . . . . 12 (𝑓 = 𝑖 → (𝑓 = (𝑞 +s 𝐶) ↔ 𝑖 = (𝑞 +s 𝐶)))
6160rexbidv 3164 . . . . . . . . . . 11 (𝑓 = 𝑖 → (∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶) ↔ ∃𝑞 ∈ ( R ‘𝐵)𝑖 = (𝑞 +s 𝐶)))
6261rexab 3643 . . . . . . . . . 10 (∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑖(∃𝑞 ∈ ( R ‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
63 rexcom4 3267 . . . . . . . . . . 11 (∃𝑞 ∈ ( R ‘𝐵)∃𝑖(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖𝑞 ∈ ( R ‘𝐵)(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
64 ovex 7396 . . . . . . . . . . . . 13 (𝑞 +s 𝐶) ∈ V
65 oveq2 7371 . . . . . . . . . . . . . 14 (𝑖 = (𝑞 +s 𝐶) → (𝐴 +s 𝑖) = (𝐴 +s (𝑞 +s 𝐶)))
6665eqeq2d 2751 . . . . . . . . . . . . 13 (𝑖 = (𝑞 +s 𝐶) → (𝑏 = (𝐴 +s 𝑖) ↔ 𝑏 = (𝐴 +s (𝑞 +s 𝐶))))
6764, 66ceqsexv 3481 . . . . . . . . . . . 12 (∃𝑖(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ 𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
6867rexbii 3087 . . . . . . . . . . 11 (∃𝑞 ∈ ( R ‘𝐵)∃𝑖(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
69 r19.41v 3170 . . . . . . . . . . . 12 (∃𝑞 ∈ ( R ‘𝐵)(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ (∃𝑞 ∈ ( R ‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
7069exbii 1855 . . . . . . . . . . 11 (∃𝑖𝑞 ∈ ( R ‘𝐵)(𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖(∃𝑞 ∈ ( R ‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)))
7163, 68, 703bitr3ri 303 . . . . . . . . . 10 (∃𝑖(∃𝑞 ∈ ( R ‘𝐵)𝑖 = (𝑞 +s 𝐶) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
7262, 71bitri 276 . . . . . . . . 9 (∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)))
73 eqeq1 2744 . . . . . . . . . . . 12 (𝑔 = 𝑖 → (𝑔 = (𝐵 +s 𝑟) ↔ 𝑖 = (𝐵 +s 𝑟)))
7473rexbidv 3164 . . . . . . . . . . 11 (𝑔 = 𝑖 → (∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟) ↔ ∃𝑟 ∈ ( R ‘𝐶)𝑖 = (𝐵 +s 𝑟)))
7574rexab 3643 . . . . . . . . . 10 (∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑖(∃𝑟 ∈ ( R ‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
76 rexcom4 3267 . . . . . . . . . . 11 (∃𝑟 ∈ ( R ‘𝐶)∃𝑖(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖𝑟 ∈ ( R ‘𝐶)(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
77 ovex 7396 . . . . . . . . . . . . 13 (𝐵 +s 𝑟) ∈ V
78 oveq2 7371 . . . . . . . . . . . . . 14 (𝑖 = (𝐵 +s 𝑟) → (𝐴 +s 𝑖) = (𝐴 +s (𝐵 +s 𝑟)))
7978eqeq2d 2751 . . . . . . . . . . . . 13 (𝑖 = (𝐵 +s 𝑟) → (𝑏 = (𝐴 +s 𝑖) ↔ 𝑏 = (𝐴 +s (𝐵 +s 𝑟))))
8077, 79ceqsexv 3481 . . . . . . . . . . . 12 (∃𝑖(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ 𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
8180rexbii 3087 . . . . . . . . . . 11 (∃𝑟 ∈ ( R ‘𝐶)∃𝑖(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
82 r19.41v 3170 . . . . . . . . . . . 12 (∃𝑟 ∈ ( R ‘𝐶)(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ (∃𝑟 ∈ ( R ‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
8382exbii 1855 . . . . . . . . . . 11 (∃𝑖𝑟 ∈ ( R ‘𝐶)(𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑖(∃𝑟 ∈ ( R ‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)))
8476, 81, 833bitr3ri 303 . . . . . . . . . 10 (∃𝑖(∃𝑟 ∈ ( R ‘𝐶)𝑖 = (𝐵 +s 𝑟) ∧ 𝑏 = (𝐴 +s 𝑖)) ↔ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
8575, 84bitri 276 . . . . . . . . 9 (∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖) ↔ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))
8672, 85orbi12i 920 . . . . . . . 8 ((∃𝑖 ∈ {𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)}𝑏 = (𝐴 +s 𝑖) ∨ ∃𝑖 ∈ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)}𝑏 = (𝐴 +s 𝑖)) ↔ (∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))))
8759, 86bitri 276 . . . . . . 7 (∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖) ↔ (∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))))
8887abbii 2807 . . . . . 6 {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)} = {𝑏 ∣ (∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))}
89 unab 4243 . . . . . 6 ({𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))}) = {𝑏 ∣ (∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶)) ∨ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)))}
90 eqeq1 2744 . . . . . . . . 9 (𝑏 = 𝑐 → (𝑏 = (𝐴 +s (𝐵 +s 𝑟)) ↔ 𝑐 = (𝐴 +s (𝐵 +s 𝑟))))
9190rexbidv 3164 . . . . . . . 8 (𝑏 = 𝑐 → (∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟)) ↔ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))))
9291cbvabv 2810 . . . . . . 7 {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))} = {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}
9392uneq2i 4102 . . . . . 6 ({𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑏 = (𝐴 +s (𝐵 +s 𝑟))}) = ({𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})
9488, 89, 933eqtr2i 2769 . . . . 5 {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)} = ({𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})
9594uneq2i 4102 . . . 4 ({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)}) = ({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ ({𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}))
96 unass 4108 . . . 4 (({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}) = ({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ ({𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))} ∪ {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))}))
9795, 96eqtr4i 2766 . . 3 ({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑖 ∈ ({𝑓 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑓 = (𝑞 +s 𝐶)} ∪ {𝑔 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑔 = (𝐵 +s 𝑟)})𝑏 = (𝐴 +s 𝑖)}) = (({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})
9858, 97oveq12i 7375 . 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 𝑟))}))
9919, 98eqtrdi 2791 1 (𝜑 → (𝐴 +s (𝐵 +s 𝐶)) = ((({𝑦 ∣ ∃𝑙 ∈ ( L ‘𝐴)𝑦 = (𝑙 +s (𝐵 +s 𝐶))} ∪ {𝑧 ∣ ∃𝑚 ∈ ( L ‘𝐵)𝑧 = (𝐴 +s (𝑚 +s 𝐶))}) ∪ {𝑤 ∣ ∃𝑛 ∈ ( L ‘𝐶)𝑤 = (𝐴 +s (𝐵 +s 𝑛))}) |s (({𝑎 ∣ ∃𝑝 ∈ ( R ‘𝐴)𝑎 = (𝑝 +s (𝐵 +s 𝐶))} ∪ {𝑏 ∣ ∃𝑞 ∈ ( R ‘𝐵)𝑏 = (𝐴 +s (𝑞 +s 𝐶))}) ∪ {𝑐 ∣ ∃𝑟 ∈ ( R ‘𝐶)𝑐 = (𝐴 +s (𝐵 +s 𝑟))})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 853   = wceq 1547  wex 1786  wcel 2119  {cab 2718  wne 2935  wrex 3064  cun 3888  c0 4268  {csn 4562   class class class wbr 5079  cfv 6492  (class class class)co 7363   No csur 27628   <<s cslts 27774   |s ccuts 27776   L cleft 27842   R cright 27843   +s cadds 27976
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-ot 4571  df-uni 4846  df-int 4885  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-1o 8402  df-2o 8403  df-nadd 8599  df-no 27631  df-lts 27632  df-bday 27633  df-les 27734  df-slts 27775  df-cuts 27777  df-0s 27824  df-made 27844  df-old 27845  df-left 27847  df-right 27848  df-norec2 27966  df-adds 27977
This theorem is referenced by:  addsass  28022
  Copyright terms: Public domain W3C validator