| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfimafnf | GIF version | ||
| Description: Alternate definition of the image of a function. (Contributed by Raph Levien, 20-Nov-2006.) (Revised by Thierry Arnoux, 24-Apr-2017.) |
| Ref | Expression |
|---|---|
| dfimafnf.1 | ⊢ Ⅎ𝑥𝐴 |
| dfimafnf.2 | ⊢ Ⅎ𝑥𝐹 |
| Ref | Expression |
|---|---|
| dfimafnf | ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfima2 5126 | . . 3 ⊢ (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦} | |
| 2 | ssel 3242 | . . . . . . 7 ⊢ (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → 𝑧 ∈ dom 𝐹)) | |
| 3 | eqcom 2240 | . . . . . . . . 9 ⊢ ((𝐹‘𝑧) = 𝑦 ↔ 𝑦 = (𝐹‘𝑧)) | |
| 4 | funbrfvb 5740 | . . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → ((𝐹‘𝑧) = 𝑦 ↔ 𝑧𝐹𝑦)) | |
| 5 | 3, 4 | bitr3id 194 | . . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)) |
| 6 | 5 | ex 115 | . . . . . . 7 ⊢ (Fun 𝐹 → (𝑧 ∈ dom 𝐹 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))) |
| 7 | 2, 6 | syl9r 73 | . . . . . 6 ⊢ (Fun 𝐹 → (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)))) |
| 8 | 7 | imp31 256 | . . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)) |
| 9 | 8 | rexbidva 2547 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦)) |
| 10 | 9 | abbidv 2358 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦}) |
| 11 | 1, 10 | eqtr4id 2290 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)}) |
| 12 | nfcv 2392 | . . . 4 ⊢ Ⅎ𝑧𝐴 | |
| 13 | dfimafnf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 14 | dfimafnf.2 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 | |
| 15 | nfcv 2392 | . . . . . 6 ⊢ Ⅎ𝑥𝑧 | |
| 16 | 14, 15 | nffv 5703 | . . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝑧) |
| 17 | 16 | nfeq2 2404 | . . . 4 ⊢ Ⅎ𝑥 𝑦 = (𝐹‘𝑧) |
| 18 | nfv 1581 | . . . 4 ⊢ Ⅎ𝑧 𝑦 = (𝐹‘𝑥) | |
| 19 | fveq2 5693 | . . . . 5 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥)) | |
| 20 | 19 | eqeq2d 2250 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘𝑥))) |
| 21 | 12, 13, 17, 18, 20 | cbvrexfw 2776 | . . 3 ⊢ (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) |
| 22 | 21 | abbii 2354 | . 2 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} |
| 23 | 11, 22 | eqtrdi 2287 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 {cab 2224 Ⅎwnfc 2379 ∃wrex 2529 ⊆ wss 3220 class class class wbr 4128 dom cdm 4772 “ cima 4775 Fun wfun 5369 ‘cfv 5375 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-fv 5383 |
| This theorem is referenced by: funimass4f 6353 |
| Copyright terms: Public domain | W3C validator |