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

Theorem fvimacnvALT 6827
Description: Alternate proof of fvimacnv 6823, based on funimass3 6824. If funimass3 6824 is ever proved directly, as opposed to using funimacnv 6435 pointwise, then the proof of funimacnv 6435 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 4741 . . 3 (𝐴 ∈ dom 𝐹 → {𝐴} ⊆ dom 𝐹)
2 funimass3 6824 . . 3 ((Fun 𝐹 ∧ {𝐴} ⊆ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (𝐹𝐵)))
31, 2sylan2 594 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (𝐹𝐵)))
4 fvex 6683 . . . 4 (𝐹𝐴) ∈ V
54snss 4718 . . 3 ((𝐹𝐴) ∈ 𝐵 ↔ {(𝐹𝐴)} ⊆ 𝐵)
6 eqid 2821 . . . . . 6 dom 𝐹 = dom 𝐹
7 df-fn 6358 . . . . . . 7 (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
87biimpri 230 . . . . . 6 ((Fun 𝐹 ∧ dom 𝐹 = dom 𝐹) → 𝐹 Fn dom 𝐹)
96, 8mpan2 689 . . . . 5 (Fun 𝐹𝐹 Fn dom 𝐹)
10 fnsnfv 6743 . . . . 5 ((𝐹 Fn dom 𝐹𝐴 ∈ dom 𝐹) → {(𝐹𝐴)} = (𝐹 “ {𝐴}))
119, 10sylan 582 . . . 4 ((Fun 𝐹𝐴 ∈ dom 𝐹) → {(𝐹𝐴)} = (𝐹 “ {𝐴}))
1211sseq1d 3998 . . 3 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ({(𝐹𝐴)} ⊆ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
135, 12syl5bb 285 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
14 snssg 4717 . . 3 (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (𝐹𝐵) ↔ {𝐴} ⊆ (𝐹𝐵)))
1514adantl 484 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → (𝐴 ∈ (𝐹𝐵) ↔ {𝐴} ⊆ (𝐹𝐵)))
163, 13, 153bitr4d 313 1 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ 𝐵𝐴 ∈ (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  wss 3936  {csn 4567  ccnv 5554  dom cdm 5555  cima 5558  Fun wfun 6349   Fn wfn 6350  cfv 6355
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-fv 6363
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator