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

Theorem funfvima3 5750
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 5628 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐹)
2 ssel 3149 . . . . . 6 (𝐹𝐺 → (⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐹 → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
31, 2syl5 32 . . . . 5 (𝐹𝐺 → ((Fun 𝐹𝐴 ∈ dom 𝐹) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
43imp 124 . . . 4 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)
5 simpr 110 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → 𝐴 ∈ dom 𝐹)
6 sneq 3603 . . . . . . . . . 10 (𝑥 = 𝐴 → {𝑥} = {𝐴})
76imaeq2d 4970 . . . . . . . . 9 (𝑥 = 𝐴 → (𝐺 “ {𝑥}) = (𝐺 “ {𝐴}))
87eleq2d 2247 . . . . . . . 8 (𝑥 = 𝐴 → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ (𝐹𝐴) ∈ (𝐺 “ {𝐴})))
9 opeq1 3778 . . . . . . . . 9 (𝑥 = 𝐴 → ⟨𝑥, (𝐹𝐴)⟩ = ⟨𝐴, (𝐹𝐴)⟩)
109eleq1d 2246 . . . . . . . 8 (𝑥 = 𝐴 → (⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺 ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
118, 10bibi12d 235 . . . . . . 7 (𝑥 = 𝐴 → (((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺) ↔ ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)))
1211adantl 277 . . . . . 6 (((Fun 𝐹𝐴 ∈ dom 𝐹) ∧ 𝑥 = 𝐴) → (((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺) ↔ ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺)))
13 vex 2740 . . . . . . 7 𝑥 ∈ V
14 funfvex 5532 . . . . . . 7 ((Fun 𝐹𝐴 ∈ dom 𝐹) → (𝐹𝐴) ∈ V)
15 elimasng 4996 . . . . . . 7 ((𝑥 ∈ V ∧ (𝐹𝐴) ∈ V) → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺))
1613, 14, 15sylancr 414 . . . . . 6 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ (𝐺 “ {𝑥}) ↔ ⟨𝑥, (𝐹𝐴)⟩ ∈ 𝐺))
175, 12, 16vtocld 2789 . . . . 5 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
1817adantl 277 . . . 4 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → ((𝐹𝐴) ∈ (𝐺 “ {𝐴}) ↔ ⟨𝐴, (𝐹𝐴)⟩ ∈ 𝐺))
194, 18mpbird 167 . . 3 ((𝐹𝐺 ∧ (Fun 𝐹𝐴 ∈ dom 𝐹)) → (𝐹𝐴) ∈ (𝐺 “ {𝐴}))
2019exp32 365 . 2 (𝐹𝐺 → (Fun 𝐹 → (𝐴 ∈ dom 𝐹 → (𝐹𝐴) ∈ (𝐺 “ {𝐴}))))
2120impcom 125 1 ((Fun 𝐹𝐹𝐺) → (𝐴 ∈ dom 𝐹 → (𝐹𝐴) ∈ (𝐺 “ {𝐴})))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1353  wcel 2148  Vcvv 2737  wss 3129  {csn 3592  cop 3595  dom cdm 4626  cima 4629  Fun wfun 5210  cfv 5216
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-br 4004  df-opab 4065  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-fv 5224
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator