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

Theorem fvimacnvALT 7048
Description: Alternate proof of fvimacnv 7044, based on funimass3 7045. If funimass3 7045 is ever proved directly, as opposed to using funimacnv 6613 pointwise, then the proof of funimacnv 6613 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 4746 . . 3 (𝐴 ∈ dom 𝐹 → {𝐴} ⊆ dom 𝐹)
2 funimass3 7045 . . 3 ((Fun 𝐹 ∧ {𝐴} ⊆ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵)))
31, 2sylan2 605 . 2 ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵)))
4 fvex 6890 . . . 4 (𝐹‘𝐴) ∈ V
54snss 4745 . . 3 ((𝐹‘𝐴) ∈ 𝐵 ↔ {(𝐹‘𝐴)} ⊆ 𝐵)
6 eqid 2761 . . . . . 6 dom 𝐹 = dom 𝐹
7 df-fn 6534 . . . . . . 7 (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
87biimpri 231 . . . . . 6 ((Fun 𝐹 ∧ dom 𝐹 = dom 𝐹) → 𝐹 Fn dom 𝐹)
96, 8mpan2 704 . . . . 5 (Fun 𝐹 → 𝐹 Fn dom 𝐹)
10 fnsnfv 6956 . . . . 5 ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴}))
119, 10sylan 592 . . . 4 ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴}))
1211sseq1d 3962 . . 3 ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ({(𝐹‘𝐴)} ⊆ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
135, 12bitrid 286 . 2 ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵))
14 snssg 4744 . . 3 (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (◡𝐹 “ 𝐵) ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵)))
1514adantl 487 . 2 ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ 𝐵) ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵)))
163, 13, 153bitr4d 314 1 ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  {csn 4584  ◡ccnv 5650  dom cdm 5651   “ cima 5654  Fun wfun 6525   Fn wfn 6526  ‘cfv 6531
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator