ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  funfvima3 GIF version

Theorem funfvima3 5445
Description: A class including a function contains the function's value in the image of the singleton of the argument. (Contributed by NM, 23-Mar-2004.)
Assertion
Ref Expression
funfvima3 ((Fun 𝐹𝐹𝐺) → (𝐴 ∈ dom 𝐹 → (𝐹𝐴) ∈ (𝐺 “ {𝐴})))

Proof of Theorem funfvima3
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 funfvop 5332 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐹)
2 ssel 3002 . . . . . 6 (𝐹𝐺 → (⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐹 → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
31, 2syl5 32 . . . . 5 (𝐹𝐺 → ((Fun 𝐹𝐴 ∈ dom 𝐹) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
43imp 122 . . . 4 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)
5 simpr 108 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → 𝐴 ∈ dom 𝐹)
6 sneq 3427 . . . . . . . . . 10 (𝑥 = 𝐴 → {𝑥} = {𝐴})
76imaeq2d 4718 . . . . . . . . 9 (𝑥 = 𝐴 → (𝐺 “ {𝑥}) = (𝐺 “ {𝐴}))
87eleq2d 2152 . . . . . . . 8 (𝑥 = 𝐴 → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ (𝐹𝐴) ∈ (𝐺 “ {𝐴})))
9 opeq1 3590 . . . . . . . . 9 (𝑥 = 𝐴 → ⟨𝑥, (𝐹𝐴)⟩ = ⟨𝐴, (𝐹𝐴)⟩)
109eleq1d 2151 . . . . . . . 8 (𝑥 = 𝐴 → (⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺 ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
118, 10bibi12d 233 . . . . . . 7 (𝑥 = 𝐴 → (((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺) ↔ ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)))
1211adantl 271 . . . . . 6 (((Fun 𝐹𝐴 ∈ dom 𝐹) ∧ 𝑥 = 𝐴) → (((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺) ↔ ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)))
13 vex 2613 . . . . . . 7 𝑥 ∈ V
14 funfvex 5244 . . . . . . 7 ((Fun 𝐹𝐴 ∈ dom 𝐹) → (𝐹𝐴) ∈ V)
15 elimasng 4743 . . . . . . 7 ((𝑥 ∈ V ∧ (𝐹𝐴) ∈ V) → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺))
1613, 14, 15sylancr 405 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺))
175, 12, 16vtocld 2660 . . . . 5 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
1817adantl 271 . . . 4 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
194, 18mpbird 165 . . 3 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → (𝐹𝐴) ∈ (𝐺 “ {𝐴}))
2019exp32 357 . 2 (𝐹𝐺 → (Fun 𝐹 → (𝐴 ∈ dom 𝐹 → (𝐹𝐴) ∈ (𝐺 “ {𝐴}))))
2120impcom 123 1 ((Fun 𝐹𝐹𝐺) → (𝐴 ∈ dom 𝐹 → (𝐹𝐴) ∈ (𝐺 “ {𝐴})))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1285  wcel 1434  Vcvv 2610  wss 2982  {csn 3416  cop 3419  dom cdm 4391  cima 4394  Fun wfun 4946  cfv 4952
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3916  ax-pow 3968  ax-pr 3992
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-v 2612  df-sbc 2825  df-un 2986  df-in 2988  df-ss 2995  df-pw 3402  df-sn 3422  df-pr 3423  df-op 3425  df-uni 3622  df-br 3806  df-opab 3860  df-id 4076  df-xp 4397  df-rel 4398  df-cnv 4399  df-co 4400  df-dm 4401  df-rn 4402  df-res 4403  df-ima 4404  df-iota 4917  df-fun 4954  df-fn 4955  df-fv 4960
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator