distrlem4prl - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > distrlem4prl		GIF version

Theorem distrlem4prl 7574

Description: Lemma for distributive law for positive reals. (Contributed by Jim Kingdon, 12-Dec-2019.)

**Assertion**
Ref	Expression
distrlem4prl	⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))

Distinct variable groups: 𝑥,𝑦,𝑧,𝑓,𝐴 𝑥,𝐵,𝑦,𝑧,𝑓 𝑥,𝐶,𝑦,𝑧,𝑓

Proof of Theorem distrlem4prl Dummy variables 𝑤 𝑣 𝑢 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltmnqg 7391	. . . . . . 7 ⊢ ((𝑤 ∈ Q ∧ 𝑣 ∈ Q ∧ 𝑢 ∈ Q) → (𝑤 <_Q 𝑣 ↔ (𝑢 ·_Q 𝑤) <_Q (𝑢 ·_Q 𝑣)))
2	1	adantl 277	. . . . . 6 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) ∧ (𝑤 ∈ Q ∧ 𝑣 ∈ Q ∧ 𝑢 ∈ Q)) → (𝑤 <_Q 𝑣 ↔ (𝑢 ·_Q 𝑤) <_Q (𝑢 ·_Q 𝑣)))
3		simp1 997	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → 𝐴 ∈ P)
4		simpll 527	. . . . . . 7 ⊢ (((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶))) → 𝑥 ∈ (1^st ‘𝐴))
5		prop 7465	. . . . . . . 8 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
6		elprnql 7471	. . . . . . . 8 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → 𝑥 ∈ Q)
7	5, 6	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → 𝑥 ∈ Q)
8	3, 4, 7	syl2an 289	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑥 ∈ Q)
9		simprl 529	. . . . . . 7 ⊢ (((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶))) → 𝑓 ∈ (1^st ‘𝐴))
10		elprnql 7471	. . . . . . . 8 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
11	5, 10	sylan 283	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
12	3, 9, 11	syl2an 289	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑓 ∈ Q)
13		simpl2 1001	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝐵 ∈ P)
14		simprlr 538	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑦 ∈ (1^st ‘𝐵))
15		prop 7465	. . . . . . . 8 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
16		elprnql 7471	. . . . . . . 8 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ 𝑦 ∈ (1^st ‘𝐵)) → 𝑦 ∈ Q)
17	15, 16	sylan 283	. . . . . . 7 ⊢ ((𝐵 ∈ P ∧ 𝑦 ∈ (1^st ‘𝐵)) → 𝑦 ∈ Q)
18	13, 14, 17	syl2anc 411	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑦 ∈ Q)
19		mulcomnqg 7373	. . . . . . 7 ⊢ ((𝑤 ∈ Q ∧ 𝑣 ∈ Q) → (𝑤 ·_Q 𝑣) = (𝑣 ·_Q 𝑤))
20	19	adantl 277	. . . . . 6 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) ∧ (𝑤 ∈ Q ∧ 𝑣 ∈ Q)) → (𝑤 ·_Q 𝑣) = (𝑣 ·_Q 𝑤))
21	2, 8, 12, 18, 20	caovord2d 6038	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 <_Q 𝑓 ↔ (𝑥 ·_Q 𝑦) <_Q (𝑓 ·_Q 𝑦)))
22		ltanqg 7390	. . . . . . 7 ⊢ ((𝑤 ∈ Q ∧ 𝑣 ∈ Q ∧ 𝑢 ∈ Q) → (𝑤 <_Q 𝑣 ↔ (𝑢 +_Q 𝑤) <_Q (𝑢 +_Q 𝑣)))
23	22	adantl 277	. . . . . 6 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) ∧ (𝑤 ∈ Q ∧ 𝑣 ∈ Q ∧ 𝑢 ∈ Q)) → (𝑤 <_Q 𝑣 ↔ (𝑢 +_Q 𝑤) <_Q (𝑢 +_Q 𝑣)))
24		mulclnq 7366	. . . . . . 7 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥 ·_Q 𝑦) ∈ Q)
25	8, 18, 24	syl2anc 411	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 ·_Q 𝑦) ∈ Q)
26		mulclnq 7366	. . . . . . 7 ⊢ ((𝑓 ∈ Q ∧ 𝑦 ∈ Q) → (𝑓 ·_Q 𝑦) ∈ Q)
27	12, 18, 26	syl2anc 411	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑓 ·_Q 𝑦) ∈ Q)
28		simpl3 1002	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝐶 ∈ P)
29		simprrr 540	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑧 ∈ (1^st ‘𝐶))
30		prop 7465	. . . . . . . . 9 ⊢ (𝐶 ∈ P → ⟨(1^st ‘𝐶), (2^nd ‘𝐶)⟩ ∈ P)
31		elprnql 7471	. . . . . . . . 9 ⊢ ((⟨(1^st ‘𝐶), (2^nd ‘𝐶)⟩ ∈ P ∧ 𝑧 ∈ (1^st ‘𝐶)) → 𝑧 ∈ Q)
32	30, 31	sylan 283	. . . . . . . 8 ⊢ ((𝐶 ∈ P ∧ 𝑧 ∈ (1^st ‘𝐶)) → 𝑧 ∈ Q)
33	28, 29, 32	syl2anc 411	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑧 ∈ Q)
34		mulclnq 7366	. . . . . . 7 ⊢ ((𝑓 ∈ Q ∧ 𝑧 ∈ Q) → (𝑓 ·_Q 𝑧) ∈ Q)
35	12, 33, 34	syl2anc 411	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑓 ·_Q 𝑧) ∈ Q)
36		addcomnqg 7371	. . . . . . 7 ⊢ ((𝑤 ∈ Q ∧ 𝑣 ∈ Q) → (𝑤 +_Q 𝑣) = (𝑣 +_Q 𝑤))
37	36	adantl 277	. . . . . 6 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) ∧ (𝑤 ∈ Q ∧ 𝑣 ∈ Q)) → (𝑤 +_Q 𝑣) = (𝑣 +_Q 𝑤))
38	23, 25, 27, 35, 37	caovord2d 6038	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑥 ·_Q 𝑦) <_Q (𝑓 ·_Q 𝑦) ↔ ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧))))
39	21, 38	bitrd 188	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 <_Q 𝑓 ↔ ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧))))
40		simpl1 1000	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝐴 ∈ P)
41		addclpr 7527	. . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐵 +_P 𝐶) ∈ P)
42	41	3adant1 1015	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐵 +_P 𝐶) ∈ P)
43	42	adantr 276	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝐵 +_P 𝐶) ∈ P)
44		mulclpr 7562	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ (𝐵 +_P 𝐶) ∈ P) → (𝐴 ·_P (𝐵 +_P 𝐶)) ∈ P)
45	40, 43, 44	syl2anc 411	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝐴 ·_P (𝐵 +_P 𝐶)) ∈ P)
46		distrnqg 7377	. . . . . . 7 ⊢ ((𝑓 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑓 ·_Q (𝑦 +_Q 𝑧)) = ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)))
47	12, 18, 33, 46	syl3anc 1238	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑓 ·_Q (𝑦 +_Q 𝑧)) = ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)))
48		simprrl 539	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑓 ∈ (1^st ‘𝐴))
49		df-iplp 7458	. . . . . . . . . 10 ⊢ +_P = (𝑢 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑤 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (1^st ‘𝑢) ∧ ℎ ∈ (1^st ‘𝑣) ∧ 𝑤 = (𝑔 +_Q ℎ))}, {𝑤 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (2^nd ‘𝑢) ∧ ℎ ∈ (2^nd ‘𝑣) ∧ 𝑤 = (𝑔 +_Q ℎ))}⟩)
50		addclnq 7365	. . . . . . . . . 10 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 +_Q ℎ) ∈ Q)
51	49, 50	genpprecll 7504	. . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) → (𝑦 +_Q 𝑧) ∈ (1^st ‘(𝐵 +_P 𝐶))))
52	51	imp 124	. . . . . . . 8 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶))) → (𝑦 +_Q 𝑧) ∈ (1^st ‘(𝐵 +_P 𝐶)))
53	13, 28, 14, 29, 52	syl22anc 1239	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑦 +_Q 𝑧) ∈ (1^st ‘(𝐵 +_P 𝐶)))
54		df-imp 7459	. . . . . . . . 9 ⊢ ·_P = (𝑢 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑤 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (1^st ‘𝑢) ∧ ℎ ∈ (1^st ‘𝑣) ∧ 𝑤 = (𝑔 ·_Q ℎ))}, {𝑤 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (2^nd ‘𝑢) ∧ ℎ ∈ (2^nd ‘𝑣) ∧ 𝑤 = (𝑔 ·_Q ℎ))}⟩)
55		mulclnq 7366	. . . . . . . . 9 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 ·_Q ℎ) ∈ Q)
56	54, 55	genpprecll 7504	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ (𝐵 +_P 𝐶) ∈ P) → ((𝑓 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑧) ∈ (1^st ‘(𝐵 +_P 𝐶))) → (𝑓 ·_Q (𝑦 +_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
57	56	imp 124	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ (𝐵 +_P 𝐶) ∈ P) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑧) ∈ (1^st ‘(𝐵 +_P 𝐶)))) → (𝑓 ·_Q (𝑦 +_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
58	40, 43, 48, 53, 57	syl22anc 1239	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑓 ·_Q (𝑦 +_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
59	47, 58	eqeltrrd 2255	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
60		prop 7465	. . . . . 6 ⊢ ((𝐴 ·_P (𝐵 +_P 𝐶)) ∈ P → ⟨(1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))), (2^nd ‘(𝐴 ·_P (𝐵 +_P 𝐶)))⟩ ∈ P)
61		prcdnql 7474	. . . . . 6 ⊢ ((⟨(1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))), (2^nd ‘(𝐴 ·_P (𝐵 +_P 𝐶)))⟩ ∈ P ∧ ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))) → (((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
62	60, 61	sylan 283	. . . . 5 ⊢ (((𝐴 ·_P (𝐵 +_P 𝐶)) ∈ P ∧ ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))) → (((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
63	45, 59, 62	syl2anc 411	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑓 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
64	39, 63	sylbid 150	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 <_Q 𝑓 → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
65	2, 12, 8, 33, 20	caovord2d 6038	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑓 <_Q 𝑥 ↔ (𝑓 ·_Q 𝑧) <_Q (𝑥 ·_Q 𝑧)))
66		mulclnq 7366	. . . . . . 7 ⊢ ((𝑥 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 ·_Q 𝑧) ∈ Q)
67	8, 33, 66	syl2anc 411	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 ·_Q 𝑧) ∈ Q)
68		ltanqg 7390	. . . . . 6 ⊢ (((𝑓 ·_Q 𝑧) ∈ Q ∧ (𝑥 ·_Q 𝑧) ∈ Q ∧ (𝑥 ·_Q 𝑦) ∈ Q) → ((𝑓 ·_Q 𝑧) <_Q (𝑥 ·_Q 𝑧) ↔ ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧))))
69	35, 67, 25, 68	syl3anc 1238	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑓 ·_Q 𝑧) <_Q (𝑥 ·_Q 𝑧) ↔ ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧))))
70	65, 69	bitrd 188	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑓 <_Q 𝑥 ↔ ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧))))
71		distrnqg 7377	. . . . . . 7 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) = ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)))
72	8, 18, 33, 71	syl3anc 1238	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) = ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)))
73		simprll 537	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → 𝑥 ∈ (1^st ‘𝐴))
74	54, 55	genpprecll 7504	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ (𝐵 +_P 𝐶) ∈ P) → ((𝑥 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑧) ∈ (1^st ‘(𝐵 +_P 𝐶))) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
75	74	imp 124	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ (𝐵 +_P 𝐶) ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑧) ∈ (1^st ‘(𝐵 +_P 𝐶)))) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
76	40, 43, 73, 53, 75	syl22anc 1239	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
77	72, 76	eqeltrrd 2255	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
78		prcdnql 7474	. . . . . 6 ⊢ ((⟨(1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))), (2^nd ‘(𝐴 ·_P (𝐵 +_P 𝐶)))⟩ ∈ P ∧ ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))) → (((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
79	60, 78	sylan 283	. . . . 5 ⊢ (((𝐴 ·_P (𝐵 +_P 𝐶)) ∈ P ∧ ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))) → (((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
80	45, 77, 79	syl2anc 411	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) <_Q ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
81	70, 80	sylbid 150	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑓 <_Q 𝑥 → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
82	64, 81	jaod 717	. 2 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
83		ltsonq 7388	. . . . 5 ⊢ <_Q Or Q
84		nqtri3or 7386	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 <_Q 𝑓 ∨ 𝑥 = 𝑓 ∨ 𝑓 <_Q 𝑥))
85	83, 84	sotritrieq 4322	. . . 4 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → (𝑥 = 𝑓 ↔ ¬ (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥)))
86	8, 12, 85	syl2anc 411	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 = 𝑓 ↔ ¬ (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥)))
87		oveq1 5876	. . . . . . 7 ⊢ (𝑥 = 𝑓 → (𝑥 ·_Q 𝑧) = (𝑓 ·_Q 𝑧))
88	87	oveq2d 5885	. . . . . 6 ⊢ (𝑥 = 𝑓 → ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) = ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)))
89	72, 88	sylan9eq 2230	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) ∧ 𝑥 = 𝑓) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) = ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)))
90	76	adantr 276	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) ∧ 𝑥 = 𝑓) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
91	89, 90	eqeltrrd 2255	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) ∧ 𝑥 = 𝑓) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))
92	91	ex 115	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (𝑥 = 𝑓 → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
93	86, 92	sylbird 170	. 2 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → (¬ (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶)))))
94		ltdcnq 7387	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → DECID 𝑥 <_Q 𝑓)
95		ltdcnq 7387	. . . . . 6 ⊢ ((𝑓 ∈ Q ∧ 𝑥 ∈ Q) → DECID 𝑓 <_Q 𝑥)
96	95	ancoms 268	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → DECID 𝑓 <_Q 𝑥)
97		dcor 935	. . . . 5 ⊢ (DECID 𝑥 <_Q 𝑓 → (DECID 𝑓 <_Q 𝑥 → DECID (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥)))
98	94, 96, 97	sylc 62	. . . 4 ⊢ ((𝑥 ∈ Q ∧ 𝑓 ∈ Q) → DECID (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥))
99	8, 12, 98	syl2anc 411	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → DECID (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥))
100		df-dc 835	. . 3 ⊢ (DECID (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥) ↔ ((𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥) ∨ ¬ (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥)))
101	99, 100	sylib 122	. 2 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥) ∨ ¬ (𝑥 <_Q 𝑓 ∨ 𝑓 <_Q 𝑥)))
102	82, 93, 101	mpjaod 718	1 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝑓 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)))) → ((𝑥 ·_Q 𝑦) +_Q (𝑓 ·_Q 𝑧)) ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 708 DECID wdc 834 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ⟨cop 3594 class class class wbr 4000 ‘cfv 5212 (class class class)co 5869 1^st c1st 6133 2^nd c2nd 6134 Qcnq 7270 +_Q cplq 7272 ·_Q cmq 7273 <_Q cltq 7275 Pcnp 7281 +_P cpp 7283 ·_P cmp 7284

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4115 ax-sep 4118 ax-nul 4126 ax-pow 4171 ax-pr 4206 ax-un 4430 ax-setind 4533 ax-iinf 4584

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-int 3843 df-iun 3886 df-br 4001 df-opab 4062 df-mpt 4063 df-tr 4099 df-eprel 4286 df-id 4290 df-po 4293 df-iso 4294 df-iord 4363 df-on 4365 df-suc 4368 df-iom 4587 df-xp 4629 df-rel 4630 df-cnv 4631 df-co 4632 df-dm 4633 df-rn 4634 df-res 4635 df-ima 4636 df-iota 5174 df-fun 5214 df-fn 5215 df-f 5216 df-f1 5217 df-fo 5218 df-f1o 5219 df-fv 5220 df-ov 5872 df-oprab 5873 df-mpo 5874 df-1st 6135 df-2nd 6136 df-recs 6300 df-irdg 6365 df-1o 6411 df-2o 6412 df-oadd 6415 df-omul 6416 df-er 6529 df-ec 6531 df-qs 6535 df-ni 7294 df-pli 7295 df-mi 7296 df-lti 7297 df-plpq 7334 df-mpq 7335 df-enq 7337 df-nqqs 7338 df-plqqs 7339 df-mqqs 7340 df-1nqqs 7341 df-rq 7342 df-ltnqqs 7343 df-enq0 7414 df-nq0 7415 df-0nq0 7416 df-plq0 7417 df-mq0 7418 df-inp 7456 df-iplp 7458 df-imp 7459

This theorem is referenced by: distrlem5prl 7576

W3C validator