| 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 7007, based on funimass3 7008. If funimass3 7008 is ever proved directly, as opposed to using funimacnv 6581 pointwise, then the proof of funimacnv 6581 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 4766 | . . 3 ⊢ (𝐴 ∈ dom 𝐹 → {𝐴} ⊆ dom 𝐹) | |
| 2 | funimass3 7008 | . . 3 ⊢ ((Fun 𝐹 ∧ {𝐴} ⊆ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) | |
| 3 | 1, 2 | sylan2 594 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) |
| 4 | fvex 6855 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
| 5 | 4 | snss 4743 | . . 3 ⊢ ((𝐹‘𝐴) ∈ 𝐵 ↔ {(𝐹‘𝐴)} ⊆ 𝐵) |
| 6 | eqid 2737 | . . . . . 6 ⊢ dom 𝐹 = dom 𝐹 | |
| 7 | df-fn 6503 | . . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹)) | |
| 8 | 7 | biimpri 228 | . . . . . 6 ⊢ ((Fun 𝐹 ∧ dom 𝐹 = dom 𝐹) → 𝐹 Fn dom 𝐹) |
| 9 | 6, 8 | mpan2 692 | . . . . 5 ⊢ (Fun 𝐹 → 𝐹 Fn dom 𝐹) |
| 10 | fnsnfv 6921 | . . . . 5 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) | |
| 11 | 9, 10 | sylan 581 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) |
| 12 | 11 | sseq1d 3967 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ({(𝐹‘𝐴)} ⊆ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵)) |
| 13 | 5, 12 | bitrid 283 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵)) |
| 14 | snssg 4742 | . . 3 ⊢ (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (◡𝐹 “ 𝐵) ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) | |
| 15 | 14 | adantl 481 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ 𝐵) ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) |
| 16 | 3, 13, 15 | 3bitr4d 311 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ⊆ wss 3903 {csn 4582 ◡ccnv 5631 dom cdm 5632 “ cima 5635 Fun wfun 6494 Fn wfn 6495 ‘cfv 6500 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-fv 6508 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |