| 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 6626 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 7052 | . . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → 〈𝐴, (𝐹‘𝐴)〉 ∈ 𝐹) | |
| 2 | fvex 6901 | . . . . . . 7 ⊢ (𝐹‘𝐴) ∈ V | |
| 3 | opelcnvg 5871 | . . . . . . 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 6096 | . . . . . 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 4755 | . . . . 5 ⊢ ((𝐹‘𝐴) ∈ 𝐵 ↔ {(𝐹‘𝐴)} ⊆ 𝐵) |
| 12 | imass2 6109 | . . . . 5 ⊢ ({(𝐹‘𝐴)} ⊆ 𝐵 → (◡𝐹 “ {(𝐹‘𝐴)}) ⊆ (◡𝐹 “ 𝐵)) | |
| 13 | 11, 12 | sylbi 220 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (◡𝐹 “ {(𝐹‘𝐴)}) ⊆ (◡𝐹 “ 𝐵)) |
| 14 | 13 | sseld 3939 | . . 3 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → (𝐴 ∈ (◡𝐹 “ {(𝐹‘𝐴)}) → 𝐴 ∈ (◡𝐹 “ 𝐵))) |
| 15 | 10, 14 | syl5com 32 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 → 𝐴 ∈ (◡𝐹 “ 𝐵))) |
| 16 | fvimacnvi 7054 | . . . 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 2146 Vcvv 3458 ⊆ wss 3908 {csn 4594 〈cop 4600 ◡ccnv 5665 dom cdm 5666 “ cima 5669 Fun wfun 6537 ‘cfv 6543 |
| 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 2148 ax-9 2156 ax-10 2179 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-fv 6551 |
| This theorem is used by: funimass3 7056 elpreima 7060 iinpreima 7071 rhmpreimaidl 21453 isr0 23931 rnelfmlem 24146 rnelfm 24147 fmfnfmlem2 24149 fmfnfmlem4 24151 fmfnfm 24152 metustid 24748 metustsym 24749 metustexhalf 24750 xppreima 33027 dstfrvel 34896 ballotlemrv 34942 bj-fvimacnv0 37971 bj-isrvec 37979 grpokerinj 38585 diaintclN 41873 dibintclN 41982 dihintcl 42159 aks6d1c2lem4 42935 aks6d1c6lem2 42979 rhmqusspan 42993 arearect 43983 areaquad 43984 tannpoly 47668 sinnpoly 47669 |
| Copyright terms: Public domain | W3C validator |