Theorem dfimafnf 32439

Description: Alternate definition of the image of a function. (Contributed by Raph Levien, 20-Nov-2006.) (Revised by Thierry Arnoux, 24-Apr-2017.)

Hypotheses

Ref	Expression
dfimafnf.1	⊢ Ⅎ𝑥𝐴
dfimafnf.2	⊢ Ⅎ𝑥𝐹

Assertion

Ref	Expression
dfimafnf	⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})

Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑦,𝐹

Allowed substitution hints:   𝐴(𝑥)   𝐹(𝑥)

Proof of Theorem dfimafnf

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfima2 6068	. . 3 ⊢ (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦}
2		ssel 3973	. . . . . . 7 ⊢ (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → 𝑧 ∈ dom 𝐹))
3		eqcom 2734	. . . . . . . . 9 ⊢ ((𝐹‘𝑧) = 𝑦 ↔ 𝑦 = (𝐹‘𝑧))
4		funbrfvb 6955	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → ((𝐹‘𝑧) = 𝑦 ↔ 𝑧𝐹𝑦))
5	3, 4	bitr3id 284	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))
6	5	ex 411	. . . . . . 7 ⊢ (Fun 𝐹 → (𝑧 ∈ dom 𝐹 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)))
7	2, 6	syl9r 78	. . . . . 6 ⊢ (Fun 𝐹 → (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))))
8	7	imp31 416	. . . . 5 ⊢ (((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))
9	8	rexbidva 3172	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦))
10	9	abbidv 2796	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦})
11	1, 10	eqtr4id 2786	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)})
12		nfcv 2898	. . . 4 ⊢ Ⅎ𝑧𝐴
13		dfimafnf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
14		dfimafnf.2	. . . . . 6 ⊢ Ⅎ𝑥𝐹
15		nfcv 2898	. . . . . 6 ⊢ Ⅎ𝑥𝑧
16	14, 15	nffv 6910	. . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝑧)
17	16	nfeq2 2916	. . . 4 ⊢ Ⅎ𝑥 𝑦 = (𝐹‘𝑧)
18		nfv 1909	. . . 4 ⊢ Ⅎ𝑧 𝑦 = (𝐹‘𝑥)
19		fveq2 6900	. . . . 5 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
20	19	eqeq2d 2738	. . . 4 ⊢ (𝑧 = 𝑥 → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘𝑥)))
21	12, 13, 17, 18, 20	cbvrexfw 3298	. . 3 ⊢ (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
22	21	abbii 2797	. 2 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
23	11, 22	eqtrdi 2783	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533   ∈ wcel 2098  {cab 2704  Ⅎwnfc 2878  ∃wrex 3066   ⊆ wss 3947   class class class wbr 5150  dom cdm 5680   “ cima 5683  Fun wfun 6545  ‘cfv 6551

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2698  ax-sep 5301  ax-nul 5308  ax-pr 5431

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2937  df-ral 3058  df-rex 3067  df-rab 3429  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4325  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4911  df-br 5151  df-opab 5213  df-id 5578  df-xp 5686  df-rel 5687  df-cnv 5688  df-co 5689  df-dm 5690  df-rn 5691  df-res 5692  df-ima 5693  df-iota 6503  df-fun 6553  df-fn 6554  df-fv 6559

This theorem is referenced by:  funimass4f  32440

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »