Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dfimafnf | Structured version Visualization version 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 | ssel 3963 | . . . . . . 7 ⊢ (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → 𝑧 ∈ dom 𝐹)) | |
2 | eqcom 2830 | . . . . . . . . 9 ⊢ ((𝐹‘𝑧) = 𝑦 ↔ 𝑦 = (𝐹‘𝑧)) | |
3 | funbrfvb 6722 | . . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → ((𝐹‘𝑧) = 𝑦 ↔ 𝑧𝐹𝑦)) | |
4 | 2, 3 | syl5bbr 287 | . . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)) |
5 | 4 | ex 415 | . . . . . . 7 ⊢ (Fun 𝐹 → (𝑧 ∈ dom 𝐹 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))) |
6 | 1, 5 | syl9r 78 | . . . . . 6 ⊢ (Fun 𝐹 → (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)))) |
7 | 6 | imp31 420 | . . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)) |
8 | 7 | rexbidva 3298 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦)) |
9 | 8 | abbidv 2887 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦}) |
10 | dfima2 5933 | . . 3 ⊢ (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦} | |
11 | 9, 10 | syl6reqr 2877 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)}) |
12 | nfcv 2979 | . . . 4 ⊢ Ⅎ𝑧𝐴 | |
13 | dfimafnf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
14 | dfimafnf.2 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 | |
15 | nfcv 2979 | . . . . . 6 ⊢ Ⅎ𝑥𝑧 | |
16 | 14, 15 | nffv 6682 | . . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝑧) |
17 | 16 | nfeq2 2997 | . . . 4 ⊢ Ⅎ𝑥 𝑦 = (𝐹‘𝑧) |
18 | nfv 1915 | . . . 4 ⊢ Ⅎ𝑧 𝑦 = (𝐹‘𝑥) | |
19 | fveq2 6672 | . . . . 5 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥)) | |
20 | 19 | eqeq2d 2834 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘𝑥))) |
21 | 12, 13, 17, 18, 20 | cbvrexfw 3440 | . . 3 ⊢ (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) |
22 | 21 | abbii 2888 | . 2 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} |
23 | 11, 22 | syl6eq 2874 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {cab 2801 Ⅎwnfc 2963 ∃wrex 3141 ⊆ wss 3938 class class class wbr 5068 dom cdm 5557 “ cima 5560 Fun wfun 6351 ‘cfv 6357 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-fv 6365 |
This theorem is referenced by: funimass4f 30384 |
Copyright terms: Public domain | W3C validator |