| 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 7025, based on funimass3 7026. If funimass3 7026 is ever proved directly, as opposed to using funimacnv 6597 pointwise, then the proof of funimacnv 6597 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 4772 | . . 3 ⊢ (𝐴 ∈ dom 𝐹 → {𝐴} ⊆ dom 𝐹) | |
| 2 | funimass3 7026 | . . 3 ⊢ ((Fun 𝐹 ∧ {𝐴} ⊆ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) | |
| 3 | 1, 2 | sylan2 593 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹 “ {𝐴}) ⊆ 𝐵 ↔ {𝐴} ⊆ (◡𝐹 “ 𝐵))) |
| 4 | fvex 6871 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
| 5 | 4 | snss 4749 | . . 3 ⊢ ((𝐹‘𝐴) ∈ 𝐵 ↔ {(𝐹‘𝐴)} ⊆ 𝐵) |
| 6 | eqid 2729 | . . . . . 6 ⊢ dom 𝐹 = dom 𝐹 | |
| 7 | df-fn 6514 | . . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹)) | |
| 8 | 7 | biimpri 228 | . . . . . 6 ⊢ ((Fun 𝐹 ∧ dom 𝐹 = dom 𝐹) → 𝐹 Fn dom 𝐹) |
| 9 | 6, 8 | mpan2 691 | . . . . 5 ⊢ (Fun 𝐹 → 𝐹 Fn dom 𝐹) |
| 10 | fnsnfv 6940 | . . . . 5 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) | |
| 11 | 9, 10 | sylan 580 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) |
| 12 | 11 | sseq1d 3978 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ({(𝐹‘𝐴)} ⊆ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵)) |
| 13 | 5, 12 | bitrid 283 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ (𝐹 “ {𝐴}) ⊆ 𝐵)) |
| 14 | snssg 4747 | . . 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 1540 ∈ wcel 2109 ⊆ wss 3914 {csn 4589 ◡ccnv 5637 dom cdm 5638 “ cima 5641 Fun wfun 6505 Fn wfn 6506 ‘cfv 6511 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-fv 6519 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |