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

Theorem distrlem5pr 10950
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 10943 . . . . 5 ((𝐴P𝐵P) → (𝐴 ·P 𝐵) ∈ P)
213adant3 1133 . . . 4 ((𝐴P𝐵P𝐶P) → (𝐴 ·P 𝐵) ∈ P)
3 mulclpr 10943 . . . 4 ((𝐴P𝐶P) → (𝐴 ·P 𝐶) ∈ P)
4 df-plp 10906 . . . . 5 +P = (𝑥P, 𝑦P ↦ {𝑓 ∣ ∃𝑔𝑥𝑦 𝑓 = (𝑔 +Q )})
5 addclnq 10868 . . . . 5 ((𝑔QQ) → (𝑔 +Q ) ∈ Q)
64, 5genpelv 10923 . . . 4 (((𝐴 ·P 𝐵) ∈ P ∧ (𝐴 ·P 𝐶) ∈ P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ↔ ∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢)))
72, 3, 63imp3i2an 1347 . . 3 ((𝐴P𝐵P𝐶P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ↔ ∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢)))
8 df-mp 10907 . . . . . . . 8 ·P = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑔𝑤𝑣 𝑥 = (𝑔 ·Q )})
9 mulclnq 10870 . . . . . . . 8 ((𝑔QQ) → (𝑔 ·Q ) ∈ Q)
108, 9genpelv 10923 . . . . . . 7 ((𝐴P𝐶P) → (𝑢 ∈ (𝐴 ·P 𝐶) ↔ ∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧)))
11103adant2 1132 . . . . . 6 ((𝐴P𝐵P𝐶P) → (𝑢 ∈ (𝐴 ·P 𝐶) ↔ ∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧)))
1211anbi2d 631 . . . . 5 ((𝐴P𝐵P𝐶P) → ((𝑣 ∈ (𝐴 ·P 𝐵) ∧ 𝑢 ∈ (𝐴 ·P 𝐶)) ↔ (𝑣 ∈ (𝐴 ·P 𝐵) ∧ ∃𝑓𝐴𝑧𝐶 𝑢 = (𝑓 ·Q 𝑧))))
13 df-mp 10907 . . . . . . . . 9 ·P = (𝑤P, 𝑣P ↦ {𝑓 ∣ ∃𝑔𝑤𝑣 𝑓 = (𝑔 ·Q )})
1413, 9genpelv 10923 . . . . . . . 8 ((𝐴P𝐵P) → (𝑣 ∈ (𝐴 ·P 𝐵) ↔ ∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦)))
15143adant3 1133 . . . . . . 7 ((𝐴P𝐵P𝐶P) → (𝑣 ∈ (𝐴 ·P 𝐵) ↔ ∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦)))
16 distrlem4pr 10949 . . . . . . . . . . . . . . 15 (((𝐴P𝐵P𝐶P) ∧ ((𝑥𝐴𝑦𝐵) ∧ (𝑓𝐴𝑧𝐶))) → ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶)))
17 oveq12 7377 . . . . . . . . . . . . . . . . . 18 ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑣 +Q 𝑢) = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)))
1817eqeq2d 2748 . . . . . . . . . . . . . . . . 17 ((𝑣 = (𝑥 ·Q 𝑦) ∧ 𝑢 = (𝑓 ·Q 𝑧)) → (𝑤 = (𝑣 +Q 𝑢) ↔ 𝑤 = ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧))))
19 eleq1 2825 . . . . . . . . . . . . . . . . 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 3180 . . . . . . . . 9 (∃𝑥𝐴𝑦𝐵 𝑣 = (𝑥 ·Q 𝑦) → ((𝑓𝐴𝑧𝐶) → (𝑢 = (𝑓 ·Q 𝑧) → ((𝐴P𝐵P𝐶P) → (𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶)))))))
2827rexlimdvv 3194 . . . . . . . 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 3194 . . 3 ((𝐴P𝐵P𝐶P) → (∃𝑣 ∈ (𝐴 ·P 𝐵)∃𝑢 ∈ (𝐴 ·P 𝐶)𝑤 = (𝑣 +Q 𝑢) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
347, 33sylbid 240 . 2 ((𝐴P𝐵P𝐶P) → (𝑤 ∈ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) → 𝑤 ∈ (𝐴 ·P (𝐵 +P 𝐶))))
3534ssrdv 3941 1 ((𝐴P𝐵P𝐶P) → ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ⊆ (𝐴 ·P (𝐵 +P 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wrex 3062  wss 3903  (class class class)co 7368   +Q cplq 10778   ·Q cmq 10779  Pcnp 10782   +P cpp 10784   ·P cmp 10785
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-inf2 9562
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-oadd 8411  df-omul 8412  df-er 8645  df-ni 10795  df-pli 10796  df-mi 10797  df-lti 10798  df-plpq 10831  df-mpq 10832  df-ltpq 10833  df-enq 10834  df-nq 10835  df-erq 10836  df-plq 10837  df-mq 10838  df-1nq 10839  df-rq 10840  df-ltnq 10841  df-np 10904  df-plp 10906  df-mp 10907
This theorem is referenced by:  distrpr  10951
  Copyright terms: Public domain W3C validator