| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fvimacnv | Structured version Visualization version GIF version | ||
| Description: The argument of a function value belongs to the preimage of any class containing the function value. Raph Levien remarks: "This proof is unsatisfying, because it seems to me that funimass2 6623 could probably be strengthened to a biconditional." (Contributed by Raph Levien, 20-Nov-2006.) |
| Ref | Expression |
|---|---|
| fvimacnv | ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funfvop 7049 | . . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → 〈𝐴, (𝐹‘𝐴)〉 ∈ 𝐹) | |
| 2 | fvex 6898 | . . . . . . 7 ⊢ (𝐹‘𝐴) ∈ V | |
| 3 | opelcnvg 5857 | . . . . . . 7 ⊢ (((𝐹‘𝐴) ∈ V ∧ 𝐴 ∈ dom 𝐹) → (〈(𝐹‘𝐴), 𝐴〉 ∈ ◡𝐹 ↔ 〈𝐴, (𝐹‘𝐴)〉 ∈ 𝐹)) | |
| 4 | 2, 3 | mpan 703 | . . . . . 6 ⊢ (𝐴 ∈ dom 𝐹 → (〈(𝐹‘𝐴), 𝐴〉 ∈ ◡𝐹 ↔ 〈𝐴, (𝐹‘𝐴)〉 ∈ 𝐹)) |
| 5 | 4 | adantl 487 | . . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (〈(𝐹‘𝐴), 𝐴〉 ∈ ◡𝐹 ↔ 〈𝐴, (𝐹‘𝐴)〉 ∈ 𝐹)) |
| 6 | 1, 5 | mpbird 260 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → 〈(𝐹‘𝐴), 𝐴〉 ∈ ◡𝐹) |
| 7 | elimasng 6086 | . . . . . 6 ⊢ (((𝐹‘𝐴) ∈ V ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) ↔ 〈(𝐹‘𝐴), 𝐴〉 ∈ ◡𝐹)) | |
| 8 | 2, 7 | mpan 703 | . . . . 5 ⊢ (𝐴 ∈ dom 𝐹 → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) ↔ 〈(𝐹‘𝐴), 𝐴〉 ∈ ◡𝐹)) |
| 9 | 8 | adantl 487 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) ↔ 〈(𝐹‘𝐴), 𝐴〉 ∈ ◡𝐹)) |
| 10 | 6, 9 | mpbird 260 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → 𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)})) |
| 11 | 2 | snss 4741 | . . . . 5 ⊢ ((𝐹‘𝐴) ∈ 𝐵 ↔ {(𝐹‘𝐴)} ⊆ 𝐵) |
| 12 | imass2 6054 | . . . . 5 ⊢ ({(𝐹‘𝐴)} ⊆ 𝐵 → (◡𝐹 “ {(𝐹‘𝐴)}) ⊆ (◡𝐹 “ 𝐵)) | |
| 13 | 11, 12 | sylbi 220 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (◡𝐹 “ {(𝐹‘𝐴)}) ⊆ (◡𝐹 “ 𝐵)) |
| 14 | 13 | sseld 3907 | . . 3 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) → 𝐴 ∈ (◡𝐹 “ 𝐵))) |
| 15 | 10, 14 | syl5com 32 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 → 𝐴 ∈ (◡𝐹 “ 𝐵))) |
| 16 | fvimacnvi 7051 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ (◡𝐹 “ 𝐵)) → (𝐹‘𝐴) ∈ 𝐵) | |
| 17 | 16 | ex 418 | . . 3 ⊢ (Fun 𝐹 → (𝐴 ∈ (◡𝐹 “ 𝐵) → (𝐹‘𝐴) ∈ 𝐵)) |
| 18 | 17 | adantr 486 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → (𝐴 ∈ (◡𝐹 “ 𝐵) → (𝐹‘𝐴) ∈ 𝐵)) |
| 19 | 15, 18 | impbid 215 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3895 {csn 4584 〈cop 4834 ◡ccnv 5649 dom cdm 5650 “ cima 5653 Fun wfun 6532 ‘cfv 6538 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-fv 6546 |
| This theorem is used by: funimass3 7053 elpreima 7057 iinpreima 7069 rhmpreimaidl 21576 isr0 24061 rnelfmlem 24276 rnelfm 24277 fmfnfmlem2 24279 fmfnfmlem4 24281 fmfnfm 24282 metustid 24878 metustsym 24879 metustexhalf 24880 xppreima 33286 dstfrvel 35152 ballotlemrv 35198 bj-fvimacnv0 38300 bj-isrvec 38308 grpokerinj 38920 diaintclN 42208 dibintclN 42317 dihintcl 42494 aks6d1c2lem4 43270 aks6d1c6lem2 43314 rhmqusspan 43328 arearect 44310 areaquad 44311 tannpoly 48033 sinnpoly 48034 |
| Copyright terms: Public domain | W3C validator |