| 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 10988 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) = {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)}) |
| 4 | 3 | eleq2d 2849 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ 𝐶 ∈ {𝑓 ∣ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)})) |
| 5 | id 23 | . . . . . 6 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 = (𝑔𝐺ℎ)) | |
| 6 | ovex 7443 | . . . . . 6 ⊢ (𝑔𝐺ℎ) ∈ V | |
| 7 | 5, 6 | eqeltrdi 2871 | . . . . 5 ⊢ (𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 8 | 7 | rexlimivw 3162 | . . . 4 ⊢ (∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 9 | 8 | rexlimivw 3162 | . . 3 ⊢ (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ) → 𝐶 ∈ V) |
| 10 | eqeq1 2767 | . . . 4 ⊢ (𝑓 = 𝐶 → (𝑓 = (𝑔𝐺ℎ) ↔ 𝐶 = (𝑔𝐺ℎ))) | |
| 11 | 10 | 2rexbidv 3230 | . . 3 ⊢ (𝑓 = 𝐶 → (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝐶 = (𝑔𝐺ℎ))) |
| 12 | 9, 11 | elab3 3645 | . 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 400 = wceq 1570 ∈ wcel 2143 {cab 2741 ∃wrex 3089 Vcvv 3455 (class class class)co 7410 ∈ cmpo 7412 Qcnq 10841 Pcnp 10848 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9606 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-ni 10861 df-nq 10901 df-np 10970 |
| This theorem is used by: genpprecl 10990 genpss 10993 genpnnp 10994 genpcd 10995 genpnmax 10996 genpass 10998 distrlem1pr 11014 distrlem5pr 11016 1idpr 11018 ltexprlem6 11030 reclem3pr 11038 reclem4pr 11039 |
| Copyright terms: Public domain | W3C validator |