Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fvimacnvALT | Structured version Visualization version GIF version |
Description: Alternate proof of fvimacnv 6826, based on funimass3 6827. If funimass3 6827 is ever proved directly, as opposed to using funimacnv 6438 pointwise, then the proof of funimacnv 6438 should be replaced with this one. (Contributed by Raph Levien, 20-Nov-2006.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
fvimacnvALT | ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snssi 4744 | . . 3 ⊢ (𝐴 ∈ dom 𝐹 → {𝐴} ⊆ dom 𝐹) | |
2 | funimass3 6827 | . . 3 ⊢ ((Fun 𝐹 ∧ {𝐴} ⊆ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) | |
3 | 1, 2 | sylan2 594 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) |
4 | fvex 6686 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
5 | 4 | snss 4721 | . . 3 ⊢ ((𝐹‘𝐴) ∈ 𝐵 ↔ {(𝐹‘𝐴)} ⊆ 𝐵) |
6 | eqid 2824 | . . . . . 6 ⊢ dom 𝐹 = dom 𝐹 | |
7 | df-fn 6361 | . . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹)) | |
8 | 7 | biimpri 230 | . . . . . 6 ⊢ ((Fun 𝐹 ∧ dom 𝐹 = dom 𝐹) → 𝐹 Fn dom 𝐹) |
9 | 6, 8 | mpan2 689 | . . . . 5 ⊢ (Fun 𝐹 → 𝐹 Fn dom 𝐹) |
10 | fnsnfv 6746 | . . . . 5 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) | |
11 | 9, 10 | sylan 582 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) |
12 | 11 | sseq1d 4001 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ({(𝐹‘𝐴)} ⊆ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵)) |
13 | 5, 12 | syl5bb 285 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵)) |
14 | snssg 4720 | . . 3 ⊢ (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (◡𝐹 “ 𝐵) ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) | |
15 | 14 | adantl 484 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ 𝐵) ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) |
16 | 3, 13, 15 | 3bitr4d 313 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ⊆ wss 3939 {csn 4570 ◡ccnv 5557 dom cdm 5558 “ cima 5561 Fun wfun 6352 Fn wfn 6353 ‘cfv 6358 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-fv 6366 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |