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

Theorem genpelv 11124
Description: Membership in value of general operation (addition or multiplication) on positive reals. (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
genp.1 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)})
genp.2 ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
Assertion
Ref Expression
genpelv ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑔,ℎ,𝐴   𝑥,𝐵,𝑦,𝑧,𝑔,ℎ   𝑥,𝑤,𝑣,𝐺,𝑦,𝑧,𝑔,ℎ   𝑔,𝐹   𝐶,𝑔,ℎ
Allowed substitution hints:   𝐴(𝑤, 𝑣)   𝐵(𝑤, 𝑣)   𝐶(𝑥, 𝑦, 𝑧, 𝑤, 𝑣)   𝐹(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, ℎ)

Proof of Theorem genpelv
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 genp.1 . . . 4 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)})
2 genp.2 . . . 4 ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
31, 2genpv 11123 . . 3 ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)})
43eleq2d 2850 . 2 ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ 𝐶 ∈ {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)}))
5 id 23 . . . . . 6 (𝐶 = (𝑔𝐺ℎ) → 𝐶 = (𝑔𝐺ℎ))
6 ovex 7484 . . . . . 6 (𝑔𝐺ℎ) ∈ V
75, 6eqeltrdi 2872 . . . . 5 (𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V)
87rexlimivw 3163 . . . 4 (∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V)
98rexlimivw 3163 . . 3 (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V)
10 eqeq1 2767 . . . 4 (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺ℎ) ↔ 𝐶 = (𝑔𝐺ℎ)))
11102rexbidv 3231 . . 3 (𝑓 = 𝐶 → (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ)))
129, 11elab3 3643 . 2 (𝐶 ∈ {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)} ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ))
134, 12bitrdi 290 1 ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090  Vcvv 3454  (class class class)co 7451   ∈ cmpo 7453  Qcnq 10976  Pcnp 10983
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-ni 10996  df-nq 11036  df-np 11105
This theorem is used by:  genpprecl  11125  genpss  11128  genpnnp  11129  genpcd  11130  genpnmax  11131  genpass  11133  distrlem1pr  11149  distrlem5pr  11151  1idpr  11153  ltexprlem6  11165  reclem3pr  11173  reclem4pr  11174
  Copyright terms: Public domain W3C validator