Theorem ecovidi 6613

Description: Lemma used to transfer a distributive law via an equivalence relation. (Contributed by Jim Kingdon, 17-Sep-2019.)

Hypotheses

Ref	Expression
ecovidi.1	⊢ 𝐷 = ((𝑆 × 𝑆) / ∼ )
ecovidi.2	⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ ) = [⟨𝑀, 𝑁⟩] ∼ )
ecovidi.3	⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑀, 𝑁⟩] ∼ ) = [⟨𝐻, 𝐽⟩] ∼ )
ecovidi.4	⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) = [⟨𝑊, 𝑋⟩] ∼ )
ecovidi.5	⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ ) = [⟨𝑌, 𝑍⟩] ∼ )
ecovidi.6	⊢ (((𝑊 ∈ 𝑆 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ∈ 𝑆 ∧ 𝑍 ∈ 𝑆)) → ([⟨𝑊, 𝑋⟩] ∼ + [⟨𝑌, 𝑍⟩] ∼ ) = [⟨𝐾, 𝐿⟩] ∼ )
ecovidi.7	⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆))
ecovidi.8	⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (𝑊 ∈ 𝑆 ∧ 𝑋 ∈ 𝑆))
ecovidi.9	⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → (𝑌 ∈ 𝑆 ∧ 𝑍 ∈ 𝑆))
ecovidi.10	⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → 𝐻 = 𝐾)
ecovidi.11	⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → 𝐽 = 𝐿)

Assertion

Ref	Expression
ecovidi	⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) → (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝐴   𝑧,𝐵,𝑤,𝑣,𝑢   𝑤,𝐶,𝑣,𝑢   𝑥, + ,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥, ∼ ,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝑆,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥, · ,𝑦,𝑧,𝑤,𝑣,𝑢   𝑧,𝐷,𝑤,𝑣,𝑢

Allowed substitution hints:   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦,𝑧)   𝐷(𝑥,𝑦)   𝐻(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐽(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐾(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐿(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝑀(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝑁(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝑊(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝑋(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝑌(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝑍(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)

Proof of Theorem ecovidi

Step	Hyp	Ref	Expression
1		ecovidi.1	. 2 ⊢ 𝐷 = ((𝑆 × 𝑆) / ∼ )
2		oveq1 5849	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ∼ = 𝐴 → ([⟨𝑥, 𝑦⟩] ∼ · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = (𝐴 · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )))
3		oveq1 5849	. . . 4 ⊢ ([⟨𝑥, 𝑦⟩] ∼ = 𝐴 → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) = (𝐴 · [⟨𝑧, 𝑤⟩] ∼ ))
4		oveq1 5849	. . . 4 ⊢ ([⟨𝑥, 𝑦⟩] ∼ = 𝐴 → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ ) = (𝐴 · [⟨𝑣, 𝑢⟩] ∼ ))
5	3, 4	oveq12d 5860	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ∼ = 𝐴 → (([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) + ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ )) = ((𝐴 · [⟨𝑧, 𝑤⟩] ∼ ) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ )))
6	2, 5	eqeq12d 2180	. 2 ⊢ ([⟨𝑥, 𝑦⟩] ∼ = 𝐴 → (([⟨𝑥, 𝑦⟩] ∼ · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = (([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) + ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ )) ↔ (𝐴 · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = ((𝐴 · [⟨𝑧, 𝑤⟩] ∼ ) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ ))))
7		oveq1 5849	. . . 4 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = 𝐵 → ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ ) = (𝐵 + [⟨𝑣, 𝑢⟩] ∼ ))
8	7	oveq2d 5858	. . 3 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = 𝐵 → (𝐴 · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = (𝐴 · (𝐵 + [⟨𝑣, 𝑢⟩] ∼ )))
9		oveq2 5850	. . . 4 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = 𝐵 → (𝐴 · [⟨𝑧, 𝑤⟩] ∼ ) = (𝐴 · 𝐵))
10	9	oveq1d 5857	. . 3 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = 𝐵 → ((𝐴 · [⟨𝑧, 𝑤⟩] ∼ ) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ )) = ((𝐴 · 𝐵) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ )))
11	8, 10	eqeq12d 2180	. 2 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = 𝐵 → ((𝐴 · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = ((𝐴 · [⟨𝑧, 𝑤⟩] ∼ ) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ )) ↔ (𝐴 · (𝐵 + [⟨𝑣, 𝑢⟩] ∼ )) = ((𝐴 · 𝐵) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ ))))
12		oveq2 5850	. . . 4 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = 𝐶 → (𝐵 + [⟨𝑣, 𝑢⟩] ∼ ) = (𝐵 + 𝐶))
13	12	oveq2d 5858	. . 3 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = 𝐶 → (𝐴 · (𝐵 + [⟨𝑣, 𝑢⟩] ∼ )) = (𝐴 · (𝐵 + 𝐶)))
14		oveq2 5850	. . . 4 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = 𝐶 → (𝐴 · [⟨𝑣, 𝑢⟩] ∼ ) = (𝐴 · 𝐶))
15	14	oveq2d 5858	. . 3 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = 𝐶 → ((𝐴 · 𝐵) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ )) = ((𝐴 · 𝐵) + (𝐴 · 𝐶)))
16	13, 15	eqeq12d 2180	. 2 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = 𝐶 → ((𝐴 · (𝐵 + [⟨𝑣, 𝑢⟩] ∼ )) = ((𝐴 · 𝐵) + (𝐴 · [⟨𝑣, 𝑢⟩] ∼ )) ↔ (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶))))
17		ecovidi.10	. . . 4 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → 𝐻 = 𝐾)
18		ecovidi.11	. . . 4 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → 𝐽 = 𝐿)
19		opeq12 3760	. . . . 5 ⊢ ((𝐻 = 𝐾 ∧ 𝐽 = 𝐿) → ⟨𝐻, 𝐽⟩ = ⟨𝐾, 𝐿⟩)
20	19	eceq1d 6537	. . . 4 ⊢ ((𝐻 = 𝐾 ∧ 𝐽 = 𝐿) → [⟨𝐻, 𝐽⟩] ∼ = [⟨𝐾, 𝐿⟩] ∼ )
21	17, 18, 20	syl2anc 409	. . 3 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → [⟨𝐻, 𝐽⟩] ∼ = [⟨𝐾, 𝐿⟩] ∼ )
22		ecovidi.2	. . . . . . 7 ⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ ) = [⟨𝑀, 𝑁⟩] ∼ )
23	22	oveq2d 5858	. . . . . 6 ⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑀, 𝑁⟩] ∼ ))
24	23	adantl 275	. . . . 5 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ ((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆))) → ([⟨𝑥, 𝑦⟩] ∼ · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑀, 𝑁⟩] ∼ ))
25		ecovidi.7	. . . . . 6 ⊢ (((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆))
26		ecovidi.3	. . . . . 6 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑀, 𝑁⟩] ∼ ) = [⟨𝐻, 𝐽⟩] ∼ )
27	25, 26	sylan2 284	. . . . 5 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ ((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆))) → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑀, 𝑁⟩] ∼ ) = [⟨𝐻, 𝐽⟩] ∼ )
28	24, 27	eqtrd 2198	. . . 4 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ ((𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆))) → ([⟨𝑥, 𝑦⟩] ∼ · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = [⟨𝐻, 𝐽⟩] ∼ )
29	28	3impb 1189	. . 3 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = [⟨𝐻, 𝐽⟩] ∼ )
30		ecovidi.4	. . . . . 6 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) = [⟨𝑊, 𝑋⟩] ∼ )
31		ecovidi.5	. . . . . 6 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ ) = [⟨𝑌, 𝑍⟩] ∼ )
32	30, 31	oveqan12d 5861	. . . . 5 ⊢ ((((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆))) → (([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) + ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ )) = ([⟨𝑊, 𝑋⟩] ∼ + [⟨𝑌, 𝑍⟩] ∼ ))
33		ecovidi.8	. . . . . 6 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) → (𝑊 ∈ 𝑆 ∧ 𝑋 ∈ 𝑆))
34		ecovidi.9	. . . . . 6 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → (𝑌 ∈ 𝑆 ∧ 𝑍 ∈ 𝑆))
35		ecovidi.6	. . . . . 6 ⊢ (((𝑊 ∈ 𝑆 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ∈ 𝑆 ∧ 𝑍 ∈ 𝑆)) → ([⟨𝑊, 𝑋⟩] ∼ + [⟨𝑌, 𝑍⟩] ∼ ) = [⟨𝐾, 𝐿⟩] ∼ )
36	33, 34, 35	syl2an 287	. . . . 5 ⊢ ((((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆))) → ([⟨𝑊, 𝑋⟩] ∼ + [⟨𝑌, 𝑍⟩] ∼ ) = [⟨𝐾, 𝐿⟩] ∼ )
37	32, 36	eqtrd 2198	. . . 4 ⊢ ((((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆)) ∧ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆))) → (([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) + ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ )) = [⟨𝐾, 𝐿⟩] ∼ )
38	37	3impdi 1283	. . 3 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → (([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) + ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ )) = [⟨𝐾, 𝐿⟩] ∼ )
39	21, 29, 38	3eqtr4d 2208	. 2 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑧 ∈ 𝑆 ∧ 𝑤 ∈ 𝑆) ∧ (𝑣 ∈ 𝑆 ∧ 𝑢 ∈ 𝑆)) → ([⟨𝑥, 𝑦⟩] ∼ · ([⟨𝑧, 𝑤⟩] ∼ + [⟨𝑣, 𝑢⟩] ∼ )) = (([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑧, 𝑤⟩] ∼ ) + ([⟨𝑥, 𝑦⟩] ∼ · [⟨𝑣, 𝑢⟩] ∼ )))
40	1, 6, 11, 16, 39	3ecoptocl 6590	1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) → (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶)))

Syntax hints:   → wi 4   ∧ wa 103   ∧ w3a 968   = wceq 1343   ∈ wcel 2136  ⟨cop 3579   × cxp 4602  (class class class)co 5842  [cec 6499   / cqs 6500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-xp 4610  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fv 5196  df-ov 5845  df-ec 6503  df-qs 6507

This theorem is referenced by:  distrnqg  7328  distrsrg  7700  axdistr  7815