Theorem distrlem1pr 11111

Description: Lemma for distributive law for positive reals. (Contributed by NM, 1-May-1996.) (Revised by Mario Carneiro, 13-Jun-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
distrlem1pr	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·P (𝐵 +P 𝐶)) ⊆ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))

Proof of Theorem distrlem1pr

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

Step	Hyp	Ref	Expression
1		addclpr 11104	. . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐵 +P 𝐶) ∈ P)
2		df-mp 11070	. . . . . 6 ⊢ ·P = (𝑦 ∈ P, 𝑧 ∈ P ↦ {𝑓 ∣ ∃𝑔 ∈ 𝑦 ∃ℎ ∈ 𝑧 𝑓 = (𝑔 ·Q ℎ)})
3		mulclnq 11033	. . . . . 6 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 ·Q ℎ) ∈ Q)
4	2, 3	genpelv 11086	. . . . 5 ⊢ ((𝐴 ∈ P ∧ (𝐵 +P 𝐶) ∈ P) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ∃𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝐵 +P 𝐶)𝑤 = (𝑥 ·Q 𝑣)))
5	1, 4	sylan2 605	. . . 4 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ 𝐶 ∈ P)) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ∃𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝐵 +P 𝐶)𝑤 = (𝑥 ·Q 𝑣)))
6	5	3impb 1132	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ∃𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝐵 +P 𝐶)𝑤 = (𝑥 ·Q 𝑣)))
7		df-plp 11069	. . . . . . . . . . 11 ⊢ +P = (𝑤 ∈ P, 𝑥 ∈ P ↦ {𝑓 ∣ ∃𝑔 ∈ 𝑤 ∃ℎ ∈ 𝑥 𝑓 = (𝑔 +Q ℎ)})
8		addclnq 11031	. . . . . . . . . . 11 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 +Q ℎ) ∈ Q)
9	7, 8	genpelv 11086	. . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑣 ∈ (𝐵 +P 𝐶) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑣 = (𝑦 +Q 𝑧)))
10	9	3adant1 1148	. . . . . . . . 9 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑣 ∈ (𝐵 +P 𝐶) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑣 = (𝑦 +Q 𝑧)))
11	10	adantr 486	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) → (𝑣 ∈ (𝐵 +P 𝐶) ↔ ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑣 = (𝑦 +Q 𝑧)))
12		simprr 785	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) → 𝑤 = (𝑥 ·Q 𝑣))
13		simpr 490	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧)) → 𝑣 = (𝑦 +Q 𝑧))
14		oveq2 7429	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = (𝑦 +Q 𝑧) → (𝑥 ·Q 𝑣) = (𝑥 ·Q (𝑦 +Q 𝑧)))
15	14	eqeq2d 2772	. . . . . . . . . . . . . 14 ⊢ (𝑣 = (𝑦 +Q 𝑧) → (𝑤 = (𝑥 ·Q 𝑣) ↔ 𝑤 = (𝑥 ·Q (𝑦 +Q 𝑧))))
16	15	biimpac 484	. . . . . . . . . . . . 13 ⊢ ((𝑤 = (𝑥 ·Q 𝑣) ∧ 𝑣 = (𝑦 +Q 𝑧)) → 𝑤 = (𝑥 ·Q (𝑦 +Q 𝑧)))
17		distrnq 11047	. . . . . . . . . . . . 13 ⊢ (𝑥 ·Q (𝑦 +Q 𝑧)) = ((𝑥 ·Q 𝑦) +Q (𝑥 ·Q 𝑧))
18	16, 17	eqtrdi 2812	. . . . . . . . . . . 12 ⊢ ((𝑤 = (𝑥 ·Q 𝑣) ∧ 𝑣 = (𝑦 +Q 𝑧)) → 𝑤 = ((𝑥 ·Q 𝑦) +Q (𝑥 ·Q 𝑧)))
19	12, 13, 18	syl2an 608	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧))) → 𝑤 = ((𝑥 ·Q 𝑦) +Q (𝑥 ·Q 𝑧)))
20		mulclpr 11106	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·P 𝐵) ∈ P)
21	20	3adant3 1150	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·P 𝐵) ∈ P)
22	21	ad2antrr 739	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧))) → (𝐴 ·P 𝐵) ∈ P)
23		mulclpr 11106	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·P 𝐶) ∈ P)
24	23	3adant2 1149	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·P 𝐶) ∈ P)
25	24	ad2antrr 739	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧))) → (𝐴 ·P 𝐶) ∈ P)
26		simpll 779	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧)) → 𝑦 ∈ 𝐵)
27	2, 3	genpprecl 11087	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥 ·Q 𝑦) ∈ (𝐴 ·P 𝐵)))
28	27	3adant3 1150	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥 ·Q 𝑦) ∈ (𝐴 ·P 𝐵)))
29	28	impl 461	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝑥 ·Q 𝑦) ∈ (𝐴 ·P 𝐵))
30	29	adantlrr 734	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ 𝑦 ∈ 𝐵) → (𝑥 ·Q 𝑦) ∈ (𝐴 ·P 𝐵))
31	26, 30	sylan2 605	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧))) → (𝑥 ·Q 𝑦) ∈ (𝐴 ·P 𝐵))
32		simplr 781	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧)) → 𝑧 ∈ 𝐶)
33	2, 3	genpprecl 11087	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) → (𝑥 ·Q 𝑧) ∈ (𝐴 ·P 𝐶)))
34	33	3adant2 1149	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) → (𝑥 ·Q 𝑧) ∈ (𝐴 ·P 𝐶)))
35	34	impl 461	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ 𝐶) → (𝑥 ·Q 𝑧) ∈ (𝐴 ·P 𝐶))
36	35	adantlrr 734	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ 𝑧 ∈ 𝐶) → (𝑥 ·Q 𝑧) ∈ (𝐴 ·P 𝐶))
37	32, 36	sylan2 605	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧))) → (𝑥 ·Q 𝑧) ∈ (𝐴 ·P 𝐶))
38	7, 8	genpprecl 11087	. . . . . . . . . . . . 13 ⊢ (((𝐴 ·P 𝐵) ∈ P ∧ (𝐴 ·P 𝐶) ∈ P) → (((𝑥 ·Q 𝑦) ∈ (𝐴 ·P 𝐵) ∧ (𝑥 ·Q 𝑧) ∈ (𝐴 ·P 𝐶)) → ((𝑥 ·Q 𝑦) +Q (𝑥 ·Q 𝑧)) ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))))
39	38	imp 412	. . . . . . . . . . . 12 ⊢ ((((𝐴 ·P 𝐵) ∈ P ∧ (𝐴 ·P 𝐶) ∈ P) ∧ ((𝑥 ·Q 𝑦) ∈ (𝐴 ·P 𝐵) ∧ (𝑥 ·Q 𝑧) ∈ (𝐴 ·P 𝐶))) → ((𝑥 ·Q 𝑦) +Q (𝑥 ·Q 𝑧)) ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))
40	22, 25, 31, 37, 39	syl22anc 852	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧))) → ((𝑥 ·Q 𝑦) +Q (𝑥 ·Q 𝑧)) ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))
41	19, 40	eqeltrd 2861	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑣 = (𝑦 +Q 𝑧))) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))
42	41	exp32 426	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) → ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) → (𝑣 = (𝑦 +Q 𝑧) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))))
43	42	rexlimdvv 3219	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) → (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑣 = (𝑦 +Q 𝑧) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))))
44	11, 43	sylbid 243	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 = (𝑥 ·Q 𝑣))) → (𝑣 ∈ (𝐵 +P 𝐶) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))))
45	44	exp32 426	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ 𝐴 → (𝑤 = (𝑥 ·Q 𝑣) → (𝑣 ∈ (𝐵 +P 𝐶) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))))))
46	45	com34 92	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ 𝐴 → (𝑣 ∈ (𝐵 +P 𝐶) → (𝑤 = (𝑥 ·Q 𝑣) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))))))
47	46	impd 416	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑥 ∈ 𝐴 ∧ 𝑣 ∈ (𝐵 +P 𝐶)) → (𝑤 = (𝑥 ·Q 𝑣) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))))
48	47	rexlimdvv 3219	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝐵 +P 𝐶)𝑤 = (𝑥 ·Q 𝑣) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))))
49	6, 48	sylbid 243	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) → 𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))))
50	49	ssrdv 3935	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·P (𝐵 +P 𝐶)) ⊆ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∃wrex 3087   ⊆ wss 3914  (class class class)co 7421   +_Q cplq 10941   ·_Q cmq 10942  Pcnp 10945   +_P cpp 10947   ·_P cmp 10948

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7752  ax-inf2 9643

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3900  df-un 3902  df-in 3904  df-ss 3915  df-pss 4035  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6305  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-1st 8002  df-2nd 8003  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-1o 8477  df-oadd 8481  df-omul 8482  df-er 8718  df-ni 10958  df-pli 10959  df-mi 10960  df-lti 10961  df-plpq 10994  df-mpq 10995  df-ltpq 10996  df-enq 10997  df-nq 10998  df-erq 10999  df-plq 11000  df-mq 11001  df-1nq 11002  df-rq 11003  df-ltnq 11004  df-np 11067  df-plp 11069  df-mp 11070

This theorem is used by:  distrpr  11114