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

Theorem funfvima3 5651
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 5532 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐹)
2 ssel 3091 . . . . . 6 (𝐹𝐺 → (⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐹 → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
31, 2syl5 32 . . . . 5 (𝐹𝐺 → ((Fun 𝐹𝐴 ∈ dom 𝐹) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
43imp 123 . . . 4 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)
5 simpr 109 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → 𝐴 ∈ dom 𝐹)
6 sneq 3538 . . . . . . . . . 10 (𝑥 = 𝐴 → {𝑥} = {𝐴})
76imaeq2d 4881 . . . . . . . . 9 (𝑥 = 𝐴 → (𝐺 “ {𝑥}) = (𝐺 “ {𝐴}))
87eleq2d 2209 . . . . . . . 8 (𝑥 = 𝐴 → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ (𝐹𝐴) ∈ (𝐺 “ {𝐴})))
9 opeq1 3705 . . . . . . . . 9 (𝑥 = 𝐴 → ⟨𝑥, (𝐹𝐴)⟩ = ⟨𝐴, (𝐹𝐴)⟩)
109eleq1d 2208 . . . . . . . 8 (𝑥 = 𝐴 → (⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺 ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
118, 10bibi12d 234 . . . . . . 7 (𝑥 = 𝐴 → (((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺) ↔ ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)))
1211adantl 275 . . . . . 6 (((Fun 𝐹𝐴 ∈ dom 𝐹) ∧ 𝑥 = 𝐴) → (((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺) ↔ ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)))
13 vex 2689 . . . . . . 7 𝑥 ∈ V
14 funfvex 5438 . . . . . . 7 ((Fun 𝐹𝐴 ∈ dom 𝐹) → (𝐹𝐴) ∈ V)
15 elimasng 4907 . . . . . . 7 ((𝑥 ∈ V ∧ (𝐹𝐴) ∈ V) → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺))
1613, 14, 15sylancr 410 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺))
175, 12, 16vtocld 2738 . . . . 5 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
1817adantl 275 . . . 4 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
194, 18mpbird 166 . . 3 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → (𝐹𝐴) ∈ (𝐺 “ {𝐴}))
2019exp32 362 . 2 (𝐹𝐺 → (Fun 𝐹 → (𝐴 ∈ dom 𝐹 → (𝐹𝐴) ∈ (𝐺 “ {𝐴}))))
2120impcom 124 1 ((Fun 𝐹𝐹𝐺) → (𝐴 ∈ dom 𝐹 → (𝐹𝐴) ∈ (𝐺 “ {𝐴})))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1331  wcel 1480  Vcvv 2686  wss 3071  {csn 3527  cop 3530  dom cdm 4539  cima 4542  Fun wfun 5117  cfv 5123
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator