| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elrnmptf | Structured version Visualization version GIF version | ||
| Description: The range of a function in maps-to notation. Same as elrnmpt 5969, but using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
| Ref | Expression |
|---|---|
| elrnmptf.1 | ⊢ Ⅎ𝑥𝐶 |
| elrnmptf.2 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
| Ref | Expression |
|---|---|
| elrnmptf | ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elrnmptf.1 | . . . 4 ⊢ Ⅎ𝑥𝐶 | |
| 2 | 1 | nfeq2 2923 | . . 3 ⊢ Ⅎ𝑥 𝑦 = 𝐶 |
| 3 | eqeq1 2741 | . . 3 ⊢ (𝑦 = 𝐶 → (𝑦 = 𝐵 ↔ 𝐶 = 𝐵)) | |
| 4 | 2, 3 | rexbid 3274 | . 2 ⊢ (𝑦 = 𝐶 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)) |
| 5 | elrnmptf.2 | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 6 | 5 | rnmpt 5968 | . 2 ⊢ ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| 7 | 4, 6 | elab2g 3680 | 1 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2108 Ⅎwnfc 2890 ∃wrex 3070 ↦ cmpt 5225 ran crn 5686 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pr 5432 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-br 5144 df-opab 5206 df-mpt 5226 df-cnv 5693 df-dm 5695 df-rn 5696 |
| This theorem is referenced by: elrnmpt1sf 45194 |
| Copyright terms: Public domain | W3C validator |