MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  distrlem5pr Structured version   Visualization version   GIF version

Theorem distrlem5pr 10910
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.
StepHypRef Expression
1 mulclpr 10903 . . . . 5 ((𝐴P𝐵P) → (𝐴 ·P 𝐵) ∈ P)
213adant3 1132 . . . 4 ((𝐴P𝐵P𝐶P) → (𝐴 ·P 𝐵) ∈ P)
3 mulclpr 10903 . . . 4 ((𝐴P𝐶P) → (𝐴 ·P 𝐶) ∈ P)
4 df-plp 10866 . . . . 5 +P = (𝑥P, 𝑦P ↦ {𝑓 ∣ ∃𝑔𝑥𝑦 𝑓 = (𝑔 +Q )})
5 addclnq 10828 . . . . 5 ((𝑔QQ) → (𝑔 +Q ) ∈ Q)
64, 5genpelv 10883 . . . 4 (((𝐴 ·P 𝐵) ∈ P ∧ (𝐴 ·P 𝐶) ∈ P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ↔ ∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢)))
72, 3, 63imp3i2an 1346 . . 3 ((𝐴P𝐵P𝐶P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ↔ ∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢)))
8 df-mp 10867 . . . . . . . 8 ·P = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑔𝑤𝑣 𝑥 = (𝑔 ·Q )})
9 mulclnq 10830 . . . . . . . 8 ((𝑔QQ) → (𝑔 ·Q ) ∈ Q)
108, 9genpelv 10883 . . . . . . 7 ((𝐴P𝐶P) → (𝑢 ∈ (𝐴 ·P 𝐶) ↔ ∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧)))
11103adant2 1131 . . . . . 6 ((𝐴P𝐵P𝐶P) → (𝑢 ∈ (𝐴 ·P 𝐶) ↔ ∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧)))
1211anbi2d 630 . . . . 5 ((𝐴P𝐵P𝐶P) → ((𝑣 ∈ (𝐴 ·P 𝐵) ∧ 𝑢 ∈ (𝐴 ·P 𝐶)) ↔ (𝑣 ∈ (𝐴 ·P 𝐵) ∧ ∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧))))
13 df-mp 10867 . . . . . . . . 9 ·P = (𝑤P, 𝑣P ↦ {𝑓 ∣ ∃𝑔𝑤𝑣 𝑓 = (𝑔 ·Q )})
1413, 9genpelv 10883 . . . . . . . 8 ((𝐴P𝐵P) → (𝑣 ∈ (𝐴 ·P 𝐵) ↔ ∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦)))
15143adant3 1132 . . . . . . 7 ((𝐴P𝐵P𝐶P) → (𝑣 ∈ (𝐴 ·P 𝐵) ↔ ∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦)))
16 distrlem4pr 10909 . . . . . . . . . . . . . . 15 (((𝐴P𝐵P𝐶P) ∧ ((𝑥𝐴𝑦𝐵) ∧ (𝑓𝐴𝑧𝐶))) → ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶)))
17 oveq12 7350 . . . . . . . . . . . . . . . . . 18 ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑣 +Q 𝑢) = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)))
1817eqeq2d 2741 . . . . . . . . . . . . . . . . 17 ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) ↔ 𝑤 = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧))))
19 eleq1 2817 . . . . . . . . . . . . . . . . 17 (𝑤 = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶))))
2018, 19biimtrdi 253 . . . . . . . . . . . . . . . 16 ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶)))))
2120imp 406 . . . . . . . . . . . . . . 15 (((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) ∧ 𝑤 = (𝑣 +Q 𝑢)) → (𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)) ↔ ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶))))
2216, 21syl5ibrcom 247 . . . . . . . . . . . . . 14 (((𝐴P𝐵P𝐶P) ∧ ((𝑥𝐴𝑦𝐵) ∧ (𝑓𝐴𝑧𝐶))) → (((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) ∧ 𝑤 = (𝑣 +Q 𝑢)) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
2322exp4b 430 . . . . . . . . . . . . 13 ((𝐴P𝐵P𝐶P) → (((𝑥𝐴𝑦𝐵) ∧ (𝑓𝐴𝑧𝐶)) → ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
2423com3l 89 . . . . . . . . . . . 12 (((𝑥𝐴𝑦𝐵) ∧ (𝑓𝐴𝑧𝐶)) → ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → ((𝐴P𝐵P𝐶P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
2524exp4b 430 . . . . . . . . . . 11 ((𝑥𝐴𝑦𝐵) → ((𝑓𝐴𝑧𝐶) → (𝑣 = (𝑥 ·Q 𝑦) → (𝑢 = (𝑓 ·Q 𝑧) → ((𝐴P𝐵P𝐶P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))))
2625com23 86 . . . . . . . . . 10 ((𝑥𝐴𝑦𝐵) → (𝑣 = (𝑥 ·Q 𝑦) → ((𝑓𝐴𝑧𝐶) → (𝑢 = (𝑓 ·Q 𝑧) → ((𝐴P𝐵P𝐶P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))))
2726rexlimivv 3172 . . . . . . . . 9 (∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦) → ((𝑓𝐴𝑧𝐶) → (𝑢 = (𝑓 ·Q 𝑧) → ((𝐴P𝐵P𝐶P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)))))))
2827rexlimdvv 3186 . . . . . . . 8 (∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦) → (∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧) → ((𝐴P𝐵P𝐶P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
2928com3r 87 . . . . . . 7 ((𝐴P𝐵P𝐶P) → (∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦) → (∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
3015, 29sylbid 240 . . . . . 6 ((𝐴P𝐵P𝐶P) → (𝑣 ∈ (𝐴 ·P 𝐵) → (∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))))
3130impd 410 . . . . 5 ((𝐴P𝐵P𝐶P) → ((𝑣 ∈ (𝐴 ·P 𝐵) ∧ ∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)))))
3212, 31sylbid 240 . . . 4 ((𝐴P𝐵P𝐶P) → ((𝑣 ∈ (𝐴 ·P 𝐵) ∧ 𝑢 ∈ (𝐴 ·P 𝐶)) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)))))
3332rexlimdvv 3186 . . 3 ((𝐴P𝐵P𝐶P) → (∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
347, 33sylbid 240 . 2 ((𝐴P𝐵P𝐶P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
3534ssrdv 3938 1 ((𝐴P𝐵P𝐶P) → ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ⊆ (𝐴 ·P (𝐵 +P 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2110  wrex 3054  wss 3900  (class class class)co 7341   +Q cplq 10738   ·Q cmq 10739  Pcnp 10742   +P cpp 10744   ·P cmp 10745
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663  ax-inf2 9526
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3344  df-reu 3345  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6244  df-ord 6305  df-on 6306  df-lim 6307  df-suc 6308  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-f1 6482  df-fo 6483  df-f1o 6484  df-fv 6485  df-ov 7344  df-oprab 7345  df-mpo 7346  df-om 7792  df-1st 7916  df-2nd 7917  df-frecs 8206  df-wrecs 8237  df-recs 8286  df-rdg 8324  df-1o 8380  df-oadd 8384  df-omul 8385  df-er 8617  df-ni 10755  df-pli 10756  df-mi 10757  df-lti 10758  df-plpq 10791  df-mpq 10792  df-ltpq 10793  df-enq 10794  df-nq 10795  df-erq 10796  df-plq 10797  df-mq 10798  df-1nq 10799  df-rq 10800  df-ltnq 10801  df-np 10864  df-plp 10866  df-mp 10867
This theorem is referenced by:  distrpr  10911
  Copyright terms: Public domain W3C validator