| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > genpelv | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| genp.1 | ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)}) |
| genp.2 | ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q) |
| Ref | Expression |
|---|---|
| genpelv | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | genp.1 | . . . 4 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)}) | |
| 2 | genp.2 | . . . 4 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q) | |
| 3 | 1, 2 | genpv 11003 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)}) |
| 4 | 3 | eleq2d 2851 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ 𝐶 ∈ {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)})) |
| 5 | id 23 | . . . . . 6 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 = (𝑔𝐺ℎ)) | |
| 6 | ovex 7452 | . . . . . 6 ⊢ (𝑔𝐺ℎ) ∈ V | |
| 7 | 5, 6 | eqeltrdi 2873 | . . . . 5 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 8 | 7 | rexlimivw 3164 | . . . 4 ⊢ (∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 9 | 8 | rexlimivw 3164 | . . 3 ⊢ (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 10 | eqeq1 2769 | . . . 4 ⊢ (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺ℎ) ↔ 𝐶 = (𝑔𝐺ℎ))) | |
| 11 | 10 | 2rexbidv 3232 | . . 3 ⊢ (𝑓 = 𝐶 → (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ))) |
| 12 | 9, 11 | elab3 3647 | . 2 ⊢ (𝐶 ∈ {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)} ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ)) |
| 13 | 4, 12 | bitrdi 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 2146 {cab 2743 ∃wrex 3091 Vcvv 3457 (class class class)co 7419 ∈ cmpo 7421 Qcnq 10856 Pcnp 10863 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-ni 10876 df-nq 10916 df-np 10985 |
| This theorem is used by: genpprecl 11005 genpss 11008 genpnnp 11009 genpcd 11010 genpnmax 11011 genpass 11013 distrlem1pr 11029 distrlem5pr 11031 1idpr 11033 ltexprlem6 11045 reclem3pr 11053 reclem4pr 11054 |
| Copyright terms: Public domain | W3C validator |