MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fvimacnvALT Structured version   Visualization version   GIF version

Theorem fvimacnvALT 6916
Description: Alternate proof of fvimacnv 6912, based on funimass3 6913. If funimass3 6913 is ever proved directly, as opposed to using funimacnv 6499 pointwise, then the proof of funimacnv 6499 should be replaced with this one. (Contributed by Raph Levien, 20-Nov-2006.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
fvimacnvALT ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ 𝐵𝐴 ∈ (𝐹𝐵)))

Proof of Theorem fvimacnvALT
StepHypRef Expression
1 snssi 4738 . . 3 (𝐴 ∈ dom 𝐹 → {𝐴} ⊆ dom 𝐹)
2 funimass3 6913 . . 3 ((Fun 𝐹 ∧ {𝐴} ⊆ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (𝐹𝐵)))
31, 2sylan2 592 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (𝐹𝐵)))
4 fvex 6769 . . . 4 (𝐹𝐴) ∈ V
54snss 4716 . . 3 ((𝐹𝐴) ∈ 𝐵 ↔ {(𝐹𝐴)} ⊆ 𝐵)
6 eqid 2738 . . . . . 6 dom 𝐹 = dom 𝐹
7 df-fn 6421 . . . . . . 7 (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
87biimpri 227 . . . . . 6 ((Fun 𝐹 ∧ dom 𝐹 = dom 𝐹) → 𝐹 Fn dom 𝐹)
96, 8mpan2 687 . . . . 5 (Fun 𝐹𝐹 Fn dom 𝐹)
10 fnsnfv 6829 . . . . 5 ((𝐹 Fn dom 𝐹𝐴 ∈ dom 𝐹) → {(𝐹𝐴)} = (𝐹 “ {𝐴}))
119, 10sylan 579 . . . 4 ((Fun 𝐹𝐴 ∈ dom 𝐹) → {(𝐹𝐴)} = (𝐹 “ {𝐴}))
1211sseq1d 3948 . . 3 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ({(𝐹𝐴)} ⊆ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
135, 12syl5bb 282 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
14 snssg 4715 . . 3 (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (𝐹𝐵) ↔ {𝐴} ⊆ (𝐹𝐵)))
1514adantl 481 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → (𝐴 ∈ (𝐹𝐵) ↔ {𝐴} ⊆ (𝐹𝐵)))
163, 13, 153bitr4d 310 1 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ 𝐵𝐴 ∈ (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wss 3883  {csn 4558  ccnv 5579  dom cdm 5580  cima 5583  Fun wfun 6412   Fn wfn 6413  cfv 6418
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator