| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elrnmpog | Structured version Visualization version GIF version | ||
| Description: Membership in the range of an operation class abstraction. (Contributed by NM, 27-Aug-2007.) (Revised by Mario Carneiro, 31-Aug-2015.) |
| Ref | Expression |
|---|---|
| rngop.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
| Ref | Expression |
|---|---|
| elrnmpog | ⊢ (𝐷 ∈ 𝑉 → (𝐷 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐷 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2767 | . . 3 ⊢ (𝑧 = 𝐷 → (𝑧 = 𝐶 ↔ 𝐷 = 𝐶)) | |
| 2 | 1 | 2rexbidv 3231 | . 2 ⊢ (𝑧 = 𝐷 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐷 = 𝐶)) |
| 3 | rngop.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
| 4 | 3 | rnmpo 7580 | . 2 ⊢ ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} |
| 5 | 2, 4 | elab2g 3637 | 1 ⊢ (𝐷 ∈ 𝑉 → (𝐷 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐷 = 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 ran crn 5657 ∈ cmpo 7448 |
| 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 5253 ax-pr 5396 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-br 5107 df-opab 5172 df-cnv 5664 df-dm 5666 df-rn 5667 df-oprab 7450 df-mpo 7451 |
| This theorem is used by: elimampo 7584 ordtbas2 23542 txopn 23954 tgisline 29128 elsx 34910 smflimlem6 48001 |
| Copyright terms: Public domain | W3C validator |