| 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 11084 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)}) |
| 4 | 3 | eleq2d 2847 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ 𝐶 ∈ {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)})) |
| 5 | id 23 | . . . . . 6 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 = (𝑔𝐺ℎ)) | |
| 6 | ovex 7453 | . . . . . 6 ⊢ (𝑔𝐺ℎ) ∈ V | |
| 7 | 5, 6 | eqeltrdi 2869 | . . . . 5 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 8 | 7 | rexlimivw 3160 | . . . 4 ⊢ (∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 9 | 8 | rexlimivw 3160 | . . 3 ⊢ (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 10 | eqeq1 2765 | . . . 4 ⊢ (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺ℎ) ↔ 𝐶 = (𝑔𝐺ℎ))) | |
| 11 | 10 | 2rexbidv 3228 | . . 3 ⊢ (𝑓 = 𝐶 → (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ))) |
| 12 | 9, 11 | elab3 3640 | . 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 2145 {cab 2739 ∃wrex 3087 Vcvv 3451 (class class class)co 7420 ∈ cmpo 7422 Qcnq 10937 Pcnp 10944 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-inf2 9642 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-ni 10957 df-nq 10997 df-np 11066 |
| This theorem is used by: genpprecl 11086 genpss 11089 genpnnp 11090 genpcd 11091 genpnmax 11092 genpass 11094 distrlem1pr 11110 distrlem5pr 11112 1idpr 11114 ltexprlem6 11126 reclem3pr 11134 reclem4pr 11135 |
| Copyright terms: Public domain | W3C validator |