Theorem fvimacnv 7030

Description: The argument of a function value belongs to the preimage of any class containing the function value. Raph Levien remarks: "This proof is unsatisfying, because it seems to me that funimass2 6600 could probably be strengthened to a biconditional." (Contributed by Raph Levien, 20-Nov-2006.)

Assertion

Ref	Expression
fvimacnv	⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵)))

Proof of Theorem fvimacnv

Step	Hyp	Ref	Expression
1		funfvop 7027	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ⟨𝐴, (𝐹‘𝐴)⟩ ∈ 𝐹)
2		fvex 6876	. . . . . . 7 ⊢ (𝐹‘𝐴) ∈ V
3		opelcnvg 5850	. . . . . . 7 ⊢ (((𝐹‘𝐴) ∈ V ∧ 𝐴 ∈ dom 𝐹) → (⟨(𝐹‘𝐴), 𝐴⟩ ∈ ◡𝐹 ↔ ⟨𝐴, (𝐹‘𝐴)⟩ ∈ 𝐹))
4	2, 3	mpan 700	. . . . . 6 ⊢ (𝐴 ∈ dom 𝐹 → (⟨(𝐹‘𝐴), 𝐴⟩ ∈ ◡𝐹 ↔ ⟨𝐴, (𝐹‘𝐴)⟩ ∈ 𝐹))
5	4	adantl 485	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (⟨(𝐹‘𝐴), 𝐴⟩ ∈ ◡𝐹 ↔ ⟨𝐴, (𝐹‘𝐴)⟩ ∈ 𝐹))
6	1, 5	mpbird 259	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ⟨(𝐹‘𝐴), 𝐴⟩ ∈ ◡𝐹)
7		elimasng 6075	. . . . . 6 ⊢ (((𝐹‘𝐴) ∈ V ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) ↔ ⟨(𝐹‘𝐴), 𝐴⟩ ∈ ◡𝐹))
8	2, 7	mpan 700	. . . . 5 ⊢ (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) ↔ ⟨(𝐹‘𝐴), 𝐴⟩ ∈ ◡𝐹))
9	8	adantl 485	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) ↔ ⟨(𝐹‘𝐴), 𝐴⟩ ∈ ◡𝐹))
10	6, 9	mpbird 259	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → 𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}))
11	2	snss 4742	. . . . 5 ⊢ ((𝐹‘𝐴) ∈ 𝐵 ↔ {(𝐹‘𝐴)} ⊆ 𝐵)
12		imass2 6088	. . . . 5 ⊢ ({(𝐹‘𝐴)} ⊆ 𝐵 → (◡𝐹 “ {(𝐹‘𝐴)}) ⊆ (◡𝐹 “ 𝐵))
13	11, 12	sylbi 219	. . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (◡𝐹 “ {(𝐹‘𝐴)}) ⊆ (◡𝐹 “ 𝐵))
14	13	sseld 3935	. . 3 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) → 𝐴 ∈ (◡𝐹 “ 𝐵)))
15	10, 14	syl5com 31	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 → 𝐴 ∈ (◡𝐹 “ 𝐵)))
16		fvimacnvi 7029	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ (◡𝐹 “ 𝐵)) → (𝐹‘𝐴) ∈ 𝐵)
17	16	ex 416	. . 3 ⊢ (Fun 𝐹 → (𝐴 ∈ (◡𝐹 “ 𝐵) → (𝐹‘𝐴) ∈ 𝐵))
18	17	adantr 484	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ 𝐵) → (𝐹‘𝐴) ∈ 𝐵))
19	15, 18	impbid 214	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∈ wcel 2141  Vcvv 3453   ⊆ wss 3904  {csn 4581  ⟨cop 4587  ^◡ccnv 5644  dom cdm 5645   “ cima 5648  Fun wfun 6511  ‘cfv 6517

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-fv 6525

This theorem is referenced by:  funimass3  7031  elpreima  7035  iinpreima  7046  rhmpreimaidl  21327  isr0  23777  rnelfmlem  23992  rnelfm  23993  fmfnfmlem2  23995  fmfnfmlem4  23997  fmfnfm  23998  metustid  24594  metustsym  24595  metustexhalf  24596  xppreima  32797  dstfrvel  34732  ballotlemrv  34778  bj-fvimacnv0  37742  bj-isrvec  37750  grpokerinj  38356  diaintclN  41646  dibintclN  41755  dihintcl  41932  aks6d1c2lem4  42708  aks6d1c6lem2  42752  rhmqusspan  42766  arearect  43756  areaquad  43757  tannpoly  47448  sinnpoly  47449