distrlem1prl - Intuitionistic Logic Explorer

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

Theorem distrlem1prl 7950

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

**Assertion**
Ref	Expression
distrlem1prl	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))) ⊆ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶))))

Proof of Theorem distrlem1prl Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addclpr 7905	. . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐵 +_P 𝐶) ∈ P)
2		df-imp 7837	. . . . . 6 ⊢ ·_P = (𝑦 ∈ P, 𝑧 ∈ P ↦ ⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (1^st ‘𝑦) ∧ ℎ ∈ (1^st ‘𝑧) ∧ 𝑓 = (𝑔 ·_Q ℎ))}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (2^nd ‘𝑦) ∧ ℎ ∈ (2^nd ‘𝑧) ∧ 𝑓 = (𝑔 ·_Q ℎ))}⟩)
3		mulclnq 7744	. . . . . 6 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 ·_Q ℎ) ∈ Q)
4	2, 3	genpelvl 7880	. . . . 5 ⊢ ((𝐴 ∈ P ∧ (𝐵 +_P 𝐶) ∈ P) → (𝑤 ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))) ↔ ∃𝑥 ∈ (1^st ‘𝐴)∃𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶))𝑤 = (𝑥 ·_Q 𝑣)))
5	1, 4	sylan2 286	. . . 4 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ 𝐶 ∈ P)) → (𝑤 ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))) ↔ ∃𝑥 ∈ (1^st ‘𝐴)∃𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶))𝑤 = (𝑥 ·_Q 𝑣)))
6	5	3impb 1230	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))) ↔ ∃𝑥 ∈ (1^st ‘𝐴)∃𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶))𝑤 = (𝑥 ·_Q 𝑣)))
7		df-iplp 7836	. . . . . . . . . . 11 ⊢ +_P = (𝑤 ∈ P, 𝑥 ∈ P ↦ ⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (1^st ‘𝑤) ∧ ℎ ∈ (1^st ‘𝑥) ∧ 𝑓 = (𝑔 +_Q ℎ))}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (2^nd ‘𝑤) ∧ ℎ ∈ (2^nd ‘𝑥) ∧ 𝑓 = (𝑔 +_Q ℎ))}⟩)
8		addclnq 7743	. . . . . . . . . . 11 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 +_Q ℎ) ∈ Q)
9	7, 8	genpelvl 7880	. . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶)) ↔ ∃𝑦 ∈ (1^st ‘𝐵)∃𝑧 ∈ (1^st ‘𝐶)𝑣 = (𝑦 +_Q 𝑧)))
10	9	3adant1 1046	. . . . . . . . 9 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶)) ↔ ∃𝑦 ∈ (1^st ‘𝐵)∃𝑧 ∈ (1^st ‘𝐶)𝑣 = (𝑦 +_Q 𝑧)))
11	10	adantr 276	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) → (𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶)) ↔ ∃𝑦 ∈ (1^st ‘𝐵)∃𝑧 ∈ (1^st ‘𝐶)𝑣 = (𝑦 +_Q 𝑧)))
12		prop 7843	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
13		elprnql 7849	. . . . . . . . . . . . . . . . 17 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → 𝑥 ∈ Q)
14	12, 13	sylan 283	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ P ∧ 𝑥 ∈ (1^st ‘𝐴)) → 𝑥 ∈ Q)
15	14	3ad2antl1 1190	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑥 ∈ (1^st ‘𝐴)) → 𝑥 ∈ Q)
16	15	adantrr 483	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) → 𝑥 ∈ Q)
17	16	adantr 276	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → 𝑥 ∈ Q)
18		prop 7843	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
19		elprnql 7849	. . . . . . . . . . . . . . . . . 18 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ 𝑦 ∈ (1^st ‘𝐵)) → 𝑦 ∈ Q)
20	18, 19	sylan 283	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐵 ∈ P ∧ 𝑦 ∈ (1^st ‘𝐵)) → 𝑦 ∈ Q)
21		prop 7843	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐶 ∈ P → ⟨(1^st ‘𝐶), (2^nd ‘𝐶)⟩ ∈ P)
22		elprnql 7849	. . . . . . . . . . . . . . . . . 18 ⊢ ((⟨(1^st ‘𝐶), (2^nd ‘𝐶)⟩ ∈ P ∧ 𝑧 ∈ (1^st ‘𝐶)) → 𝑧 ∈ Q)
23	21, 22	sylan 283	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐶 ∈ P ∧ 𝑧 ∈ (1^st ‘𝐶)) → 𝑧 ∈ Q)
24	20, 23	anim12i 338	. . . . . . . . . . . . . . . 16 ⊢ (((𝐵 ∈ P ∧ 𝑦 ∈ (1^st ‘𝐵)) ∧ (𝐶 ∈ P ∧ 𝑧 ∈ (1^st ‘𝐶))) → (𝑦 ∈ Q ∧ 𝑧 ∈ Q))
25	24	an4s 596	. . . . . . . . . . . . . . 15 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶))) → (𝑦 ∈ Q ∧ 𝑧 ∈ Q))
26	25	3adantl1 1184	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶))) → (𝑦 ∈ Q ∧ 𝑧 ∈ Q))
27	26	ad2ant2r 513	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → (𝑦 ∈ Q ∧ 𝑧 ∈ Q))
28		3anass 1013	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) ↔ (𝑥 ∈ Q ∧ (𝑦 ∈ Q ∧ 𝑧 ∈ Q)))
29	17, 27, 28	sylanbrc 421	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → (𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q))
30		simprr 537	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) → 𝑤 = (𝑥 ·_Q 𝑣))
31		simpr 110	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧)) → 𝑣 = (𝑦 +_Q 𝑧))
32	30, 31	anim12i 338	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → (𝑤 = (𝑥 ·_Q 𝑣) ∧ 𝑣 = (𝑦 +_Q 𝑧)))
33		oveq2 6093	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = (𝑦 +_Q 𝑧) → (𝑥 ·_Q 𝑣) = (𝑥 ·_Q (𝑦 +_Q 𝑧)))
34	33	eqeq2d 2250	. . . . . . . . . . . . . 14 ⊢ (𝑣 = (𝑦 +_Q 𝑧) → (𝑤 = (𝑥 ·_Q 𝑣) ↔ 𝑤 = (𝑥 ·_Q (𝑦 +_Q 𝑧))))
35	34	biimpac 298	. . . . . . . . . . . . 13 ⊢ ((𝑤 = (𝑥 ·_Q 𝑣) ∧ 𝑣 = (𝑦 +_Q 𝑧)) → 𝑤 = (𝑥 ·_Q (𝑦 +_Q 𝑧)))
36		distrnqg 7755	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 ·_Q (𝑦 +_Q 𝑧)) = ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)))
37	36	eqeq2d 2250	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑤 = (𝑥 ·_Q (𝑦 +_Q 𝑧)) ↔ 𝑤 = ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧))))
38	35, 37	imbitrid 154	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → ((𝑤 = (𝑥 ·_Q 𝑣) ∧ 𝑣 = (𝑦 +_Q 𝑧)) → 𝑤 = ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧))))
39	29, 32, 38	sylc 62	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → 𝑤 = ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)))
40		mulclpr 7940	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·_P 𝐵) ∈ P)
41	40	3adant3 1048	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·_P 𝐵) ∈ P)
42	41	ad2antrr 492	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → (𝐴 ·_P 𝐵) ∈ P)
43		mulclpr 7940	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·_P 𝐶) ∈ P)
44	43	3adant2 1047	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·_P 𝐶) ∈ P)
45	44	ad2antrr 492	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → (𝐴 ·_P 𝐶) ∈ P)
46		simpll 531	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧)) → 𝑦 ∈ (1^st ‘𝐵))
47	2, 3	genpprecll 7882	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) → (𝑥 ·_Q 𝑦) ∈ (1^st ‘(𝐴 ·_P 𝐵))))
48	47	3adant3 1048	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑦 ∈ (1^st ‘𝐵)) → (𝑥 ·_Q 𝑦) ∈ (1^st ‘(𝐴 ·_P 𝐵))))
49	48	impl 380	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑥 ∈ (1^st ‘𝐴)) ∧ 𝑦 ∈ (1^st ‘𝐵)) → (𝑥 ·_Q 𝑦) ∈ (1^st ‘(𝐴 ·_P 𝐵)))
50	49	adantlrr 487	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ 𝑦 ∈ (1^st ‘𝐵)) → (𝑥 ·_Q 𝑦) ∈ (1^st ‘(𝐴 ·_P 𝐵)))
51	46, 50	sylan2 286	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → (𝑥 ·_Q 𝑦) ∈ (1^st ‘(𝐴 ·_P 𝐵)))
52		simplr 533	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧)) → 𝑧 ∈ (1^st ‘𝐶))
53	2, 3	genpprecll 7882	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)) → (𝑥 ·_Q 𝑧) ∈ (1^st ‘(𝐴 ·_P 𝐶))))
54	53	3adant2 1047	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑧 ∈ (1^st ‘𝐶)) → (𝑥 ·_Q 𝑧) ∈ (1^st ‘(𝐴 ·_P 𝐶))))
55	54	impl 380	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑥 ∈ (1^st ‘𝐴)) ∧ 𝑧 ∈ (1^st ‘𝐶)) → (𝑥 ·_Q 𝑧) ∈ (1^st ‘(𝐴 ·_P 𝐶)))
56	55	adantlrr 487	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ 𝑧 ∈ (1^st ‘𝐶)) → (𝑥 ·_Q 𝑧) ∈ (1^st ‘(𝐴 ·_P 𝐶)))
57	52, 56	sylan2 286	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → (𝑥 ·_Q 𝑧) ∈ (1^st ‘(𝐴 ·_P 𝐶)))
58	7, 8	genpprecll 7882	. . . . . . . . . . . . 13 ⊢ (((𝐴 ·_P 𝐵) ∈ P ∧ (𝐴 ·_P 𝐶) ∈ P) → (((𝑥 ·_Q 𝑦) ∈ (1^st ‘(𝐴 ·_P 𝐵)) ∧ (𝑥 ·_Q 𝑧) ∈ (1^st ‘(𝐴 ·_P 𝐶))) → ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶)))))
59	58	imp 124	. . . . . . . . . . . 12 ⊢ ((((𝐴 ·_P 𝐵) ∈ P ∧ (𝐴 ·_P 𝐶) ∈ P) ∧ ((𝑥 ·_Q 𝑦) ∈ (1^st ‘(𝐴 ·_P 𝐵)) ∧ (𝑥 ·_Q 𝑧) ∈ (1^st ‘(𝐴 ·_P 𝐶)))) → ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶))))
60	42, 45, 51, 57, 59	syl22anc 1279	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → ((𝑥 ·_Q 𝑦) +_Q (𝑥 ·_Q 𝑧)) ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶))))
61	39, 60	eqeltrd 2315	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) ∧ ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) ∧ 𝑣 = (𝑦 +_Q 𝑧))) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶))))
62	61	exp32 365	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) → ((𝑦 ∈ (1^st ‘𝐵) ∧ 𝑧 ∈ (1^st ‘𝐶)) → (𝑣 = (𝑦 +_Q 𝑧) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶))))))
63	62	rexlimdvv 2675	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) → (∃𝑦 ∈ (1^st ‘𝐵)∃𝑧 ∈ (1^st ‘𝐶)𝑣 = (𝑦 +_Q 𝑧) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶)))))
64	11, 63	sylbid 150	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ (1^st ‘𝐴) ∧ 𝑤 = (𝑥 ·_Q 𝑣))) → (𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶)) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶)))))
65	64	exp32 365	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘𝐴) → (𝑤 = (𝑥 ·_Q 𝑣) → (𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶)) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶)))))))
66	65	com34 83	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘𝐴) → (𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶)) → (𝑤 = (𝑥 ·_Q 𝑣) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶)))))))
67	66	impd 254	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ (1^st ‘𝐴) ∧ 𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶))) → (𝑤 = (𝑥 ·_Q 𝑣) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶))))))
68	67	rexlimdvv 2675	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑥 ∈ (1^st ‘𝐴)∃𝑣 ∈ (1^st ‘(𝐵 +_P 𝐶))𝑤 = (𝑥 ·_Q 𝑣) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶)))))
69	6, 68	sylbid 150	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 ∈ (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))) → 𝑤 ∈ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶)))))
70	69	ssrdv 3254	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (1^st ‘(𝐴 ·_P (𝐵 +_P 𝐶))) ⊆ (1^st ‘((𝐴 ·_P 𝐵) +_P (𝐴 ·_P 𝐶))))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 ⊆ wss 3220 ⟨cop 3712 ‘cfv 5377 (class class class)co 6085 1^st c1st 6372 2^nd c2nd 6373 Qcnq 7648 +_Q cplq 7650 ·_Q cmq 7651 Pcnp 7659 +_P cpp 7661 ·_P cmp 7662

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-eprel 4434 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-1o 6687 df-2o 6688 df-oadd 6691 df-omul 6692 df-er 6807 df-ec 6809 df-qs 6813 df-ni 7672 df-pli 7673 df-mi 7674 df-lti 7675 df-plpq 7712 df-mpq 7713 df-enq 7715 df-nqqs 7716 df-plqqs 7717 df-mqqs 7718 df-1nqqs 7719 df-rq 7720 df-ltnqqs 7721 df-enq0 7792 df-nq0 7793 df-0nq0 7794 df-plq0 7795 df-mq0 7796 df-inp 7834 df-iplp 7836 df-imp 7837

This theorem is used by: distrprg 7956

W3C validator