Theorem distrlem5pr 11040

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

Assertion

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

Proof of Theorem distrlem5pr

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

Step	Hyp	Ref	Expression
1		mulclpr 11033	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ·P 𝐵) ∈ P)
2	1	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·P 𝐵) ∈ P)
3		mulclpr 11033	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ P) → (𝐴 ·P 𝐶) ∈ P)
4		df-plp 10996	. . . . 5 ⊢ +P = (𝑥 ∈ P, 𝑦 ∈ P ↦ {𝑓 ∣ ∃𝑔 ∈ 𝑥 ∃ℎ ∈ 𝑦 𝑓 = (𝑔 +Q ℎ)})
5		addclnq 10958	. . . . 5 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 +Q ℎ) ∈ Q)
6	4, 5	genpelv 11013	. . . 4 ⊢ (((𝐴 ·P 𝐵) ∈ P ∧ (𝐴 ·P 𝐶) ∈ P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ↔ ∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢)))
7	2, 3, 6	3imp3i2an 1364	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ↔ ∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢)))
8		df-mp 10997	. . . . . . . 8 ⊢ ·P = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑔 ∈ 𝑤 ∃ℎ ∈ 𝑣 𝑥 = (𝑔 ·Q ℎ)})
9		mulclnq 10960	. . . . . . . 8 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 ·Q ℎ) ∈ Q)
10	8, 9	genpelv 11013	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐶 ∈ P) → (𝑢 ∈ (𝐴 ·P 𝐶) ↔ ∃𝑓 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑢 = (𝑓 ·Q 𝑧)))
11	10	3adant2 1149	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑢 ∈ (𝐴 ·P 𝐶) ↔ ∃𝑓 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑢 = (𝑓 ·Q 𝑧)))
12	11	anbi2d 642	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑣 ∈ (𝐴 ·P 𝐵) ∧ 𝑢 ∈ (𝐴 ·P 𝐶)) ↔ (𝑣 ∈ (𝐴 ·P 𝐵) ∧ ∃𝑓 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑢 = (𝑓 ·Q 𝑧))))
13		df-mp 10997	. . . . . . . . 9 ⊢ ·P = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑓 ∣ ∃𝑔 ∈ 𝑤 ∃ℎ ∈ 𝑣 𝑓 = (𝑔 ·Q ℎ)})
14	13, 9	genpelv 11013	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑣 ∈ (𝐴 ·P 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑣 = (𝑥 ·Q 𝑦)))
15	14	3adant3 1150	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑣 ∈ (𝐴 ·P 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑣 = (𝑥 ·Q 𝑦)))
16		distrlem4pr 11039	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑓 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶))) → ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶)))
17		oveq12 7426	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑣 +Q 𝑢) = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)))
18	17	eqeq2d 2773	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) ↔ 𝑤 = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧))))
19		eleq1 2850	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶))))
20	18, 19	biimtrdi 256	. . . . . . . . . . . . . . . 16 ⊢ ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶)))))
21	20	imp 412	. . . . . . . . . . . . . . 15 ⊢ (((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) ∧ 𝑤 = (𝑣 +Q 𝑢)) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶))))
22	16, 21	syl5ibrcom 250	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑓 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶))) → (((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) ∧ 𝑤 = (𝑣 +Q 𝑢)) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
23	22	exp4b 436	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑓 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) → ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
24	23	com3l 90	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑓 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶)) → ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
25	24	exp4b 436	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ((𝑓 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) → (𝑣 = (𝑥 ·Q 𝑦) → (𝑢 = (𝑓 ·Q 𝑧) → ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))))
26	25	com23 87	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑣 = (𝑥 ·Q 𝑦) → ((𝑓 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) → (𝑢 = (𝑓 ·Q 𝑧) → ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))))
27	26	rexlimivv 3206	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑣 = (𝑥 ·Q 𝑦) → ((𝑓 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) → (𝑢 = (𝑓 ·Q 𝑧) → ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)))))))
28	27	rexlimdvv 3220	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑣 = (𝑥 ·Q 𝑦) → (∃𝑓 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑢 = (𝑓 ·Q 𝑧) → ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
29	28	com3r 88	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑣 = (𝑥 ·Q 𝑦) → (∃𝑓 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑢 = (𝑓 ·Q 𝑧) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
30	15, 29	sylbid 243	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑣 ∈ (𝐴 ·P 𝐵) → (∃𝑓 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑢 = (𝑓 ·Q 𝑧) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
31	30	impd 416	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑣 ∈ (𝐴 ·P 𝐵) ∧ ∃𝑓 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)))))
32	12, 31	sylbid 243	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑣 ∈ (𝐴 ·P 𝐵) ∧ 𝑢 ∈ (𝐴 ·P 𝐶)) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)))))
33	32	rexlimdvv 3220	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
34	7, 33	sylbid 243	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
35	34	ssrdv 3940	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 3088   ⊆ wss 3902  (class class class)co 7417   +_Q cplq 10868   ·_Q cmq 10869  Pcnp 10872   +_P cpp 10874   ·_P cmp 10875

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-inf2 9624

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-oadd 8463  df-omul 8464  df-er 8700  df-ni 10885  df-pli 10886  df-mi 10887  df-lti 10888  df-plpq 10921  df-mpq 10922  df-ltpq 10923  df-enq 10924  df-nq 10925  df-erq 10926  df-plq 10927  df-mq 10928  df-1nq 10929  df-rq 10930  df-ltnq 10931  df-np 10994  df-plp 10996  df-mp 10997

This theorem is used by:  distrpr  11041