| 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 11011 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)}) |
| 4 | 3 | eleq2d 2846 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ 𝐶 ∈ {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)})) |
| 5 | id 23 | . . . . . 6 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 = (𝑔𝐺ℎ)) | |
| 6 | ovex 7447 | . . . . . 6 ⊢ (𝑔𝐺ℎ) ∈ V | |
| 7 | 5, 6 | eqeltrdi 2868 | . . . . 5 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 8 | 7 | rexlimivw 3159 | . . . 4 ⊢ (∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 9 | 8 | rexlimivw 3159 | . . 3 ⊢ (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 10 | eqeq1 2764 | . . . 4 ⊢ (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺ℎ) ↔ 𝐶 = (𝑔𝐺ℎ))) | |
| 11 | 10 | 2rexbidv 3227 | . . 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 2738 ∃wrex 3086 Vcvv 3450 (class class class)co 7414 ∈ cmpo 7416 Qcnq 10864 Pcnp 10871 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-inf2 9623 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fv 6541 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-ni 10884 df-nq 10924 df-np 10993 |
| This theorem is used by: genpprecl 11013 genpss 11016 genpnnp 11017 genpcd 11018 genpnmax 11019 genpass 11021 distrlem1pr 11037 distrlem5pr 11039 1idpr 11041 ltexprlem6 11053 reclem3pr 11061 reclem4pr 11062 |
| Copyright terms: Public domain | W3C validator |