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 33281
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 6060 . . 3 (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦}
2 ssel 3903 . . . . . . 7 (𝐴 ⊆ dom 𝐹 → (𝑧 ∈ 𝐴 → 𝑧 ∈ dom 𝐹))
3 eqcom 2767 . . . . . . . . 9 ((𝐹‘𝑧) = 𝑦 ↔ 𝑦 = (𝐹‘𝑧))
4 funbrfvb 6943 . . . . . . . . 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 3184 . . . 4 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦))
109abbidv 2826 . . 3 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑧𝐹𝑦})
111, 10eqtr4id 2814 . 2 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)})
12 nfcv 2922 . . . 4 Ⅎ𝑧𝐴
13 dfimafnf.1 . . . 4 Ⅎ𝑥𝐴
14 dfimafnf.2 . . . . . 6 Ⅎ𝑥𝐹
15 nfcv 2922 . . . . . 6 Ⅎ𝑥𝑧
1614, 15nffv 6900 . . . . 5 Ⅎ𝑥(𝐹‘𝑧)
1716nfeq2 2939 . . . 4 Ⅎ𝑥 𝑦 = (𝐹‘𝑧)
18 nfv 1946 . . . 4 Ⅎ𝑧 𝑦 = (𝐹‘𝑥)
19 fveq2 6890 . . . . 5 (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
2019eqeq2d 2771 . . . 4 (𝑧 = 𝑥 → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘𝑥)))
2112, 13, 17, 18, 20cbvrexfw 3303 . . 3 (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
2221abbii 2827 . 2 {𝑦 ∣ ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧)} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
2311, 22eqtrdi 2811 1 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  Ⅎwnfc 2907  ∃wrex 3086   ⊆ wss 3896   class class class wbr 5102  dom cdm 5651   “ cima 5654  Fun wfun 6537  ‘cfv 6543
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  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 6497  df-fun 6545  df-fn 6546  df-fv 6551
This theorem is used by:  funimass4f  33282
  Copyright terms: Public domain W3C validator