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

Theorem fvimacnvALT 7005
Description: Alternate proof of fvimacnv 7001, based on funimass3 7002. If funimass3 7002 is ever proved directly, as opposed to using funimacnv 6573 pointwise, then the proof of funimacnv 6573 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 4724 . . 3 (𝐴 ∈ dom 𝐹 → {𝐴} ⊆ dom 𝐹)
2 funimass3 7002 . . 3 ((Fun 𝐹 ∧ {𝐴} ⊆ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (𝐹𝐵)))
31, 2sylan2 599 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (𝐹𝐵)))
4 fvex 6847 . . . 4 (𝐹𝐴) ∈ V
54snss 4723 . . 3 ((𝐹𝐴) ∈ 𝐵 ↔ {(𝐹𝐴)} ⊆ 𝐵)
6 eqid 2740 . . . . . 6 dom 𝐹 = dom 𝐹
7 df-fn 6495 . . . . . . 7 (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
87biimpri 229 . . . . . 6 ((Fun 𝐹 ∧ dom 𝐹 = dom 𝐹) → 𝐹 Fn dom 𝐹)
96, 8mpan2 697 . . . . 5 (Fun 𝐹𝐹 Fn dom 𝐹)
10 fnsnfv 6913 . . . . 5 ((𝐹 Fn dom 𝐹𝐴 ∈ dom 𝐹) → {(𝐹𝐴)} = (𝐹 “ {𝐴}))
119, 10sylan 586 . . . 4 ((Fun 𝐹𝐴 ∈ dom 𝐹) → {(𝐹𝐴)} = (𝐹 “ {𝐴}))
1211sseq1d 3953 . . 3 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ({(𝐹𝐴)} ⊆ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
135, 12bitrid 284 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
14 snssg 4722 . . 3 (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (𝐹𝐵) ↔ {𝐴} ⊆ (𝐹𝐵)))
1514adantl 482 . 2 ((Fun 𝐹𝐴 ∈ dom 𝐹) → (𝐴 ∈ (𝐹𝐵) ↔ {𝐴} ⊆ (𝐹𝐵)))
163, 13, 153bitr4d 312 1 ((Fun 𝐹𝐴 ∈ dom 𝐹) → ((𝐹𝐴) ∈ 𝐵𝐴 ∈ (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wss 3890  {csn 4562  ccnv 5624  dom cdm 5625  cima 5628  Fun wfun 6486   Fn wfn 6487  cfv 6492
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-fv 6500
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator