Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfimafnf Structured version   Visualization version   GIF version

Theorem dfimafnf 33223
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.
StepHypRef Expression
1 dfima2 6058 . . 3 (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦}
2 ssel 3925 . . . . . . 7 (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → 𝑧 ∈ dom 𝐹))
3 eqcom 2768 . . . . . . . . 9 ((𝐹‘𝑧) = 𝑦 ↔ 𝑦 = (𝐹‘𝑧))
4 funbrfvb 6936 . . . . . . . . 9 ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → ((𝐹‘𝑧) = 𝑦 ↔ 𝑧𝐹𝑦))
53, 4bitr3id 288 . . . . . . . 8 ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))
65ex 418 . . . . . . 7 (Fun 𝐹 → (𝑧 ∈ dom 𝐹 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦)))
72, 6syl9r 79 . . . . . 6 (Fun 𝐹 → (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))))
87imp31 423 . . . . 5 (((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (𝐹‘𝑧) ↔ 𝑧𝐹𝑦))
98rexbidva 3185 . . . 4 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦))
109abbidv 2827 . . 3 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦})
111, 10eqtr4id 2815 . 2 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)})
12 nfcv 2923 . . . 4 Ⅎ𝑧𝐴
13 dfimafnf.1 . . . 4 Ⅎ𝑥𝐴
14 dfimafnf.2 . . . . . 6 Ⅎ𝑥𝐹
15 nfcv 2923 . . . . . 6 Ⅎ𝑥𝑧
1614, 15nffv 6893 . . . . 5 Ⅎ𝑥(𝐹‘𝑧)
1716nfeq2 2940 . . . 4 Ⅎ𝑥 𝑦 = (𝐹‘𝑧)
18 nfv 1947 . . . 4 Ⅎ𝑧 𝑦 = (𝐹‘𝑥)
19 fveq2 6883 . . . . 5 (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
2019eqeq2d 2772 . . . 4 (𝑧 = 𝑥 → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘𝑥)))
2112, 13, 17, 18, 20cbvrexfw 3304 . . 3 (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
2221abbii 2828 . 2 {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
2311, 22eqtrdi 2812 1 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  Ⅎwnfc 2908  ∃wrex 3087   ⊆ wss 3899   class class class wbr 5103  dom cdm 5651   “ cima 5654  Fun wfun 6531  ‘cfv 6537
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545
This theorem is used by:  funimass4f  33224
  Copyright terms: Public domain W3C validator