| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1imacnv | Structured version Visualization version GIF version | ||
| Description: Preimage of an image. (Contributed by NM, 30-Sep-2004.) |
| Ref | Expression |
|---|---|
| f1imacnv | ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡𝐹 “ (𝐹 “ 𝐶)) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resima 6055 | . 2 ⊢ ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶)) = (◡𝐹 “ (𝐹 “ 𝐶)) | |
| 2 | df-f1 6543 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
| 3 | 2 | simprbi 503 | . . . . . 6 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹) |
| 4 | 3 | adantr 486 | . . . . 5 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → Fun ◡𝐹) |
| 5 | funcnvres 6618 | . . . . 5 ⊢ (Fun ◡𝐹 → ◡(𝐹 ↾ 𝐶) = (◡𝐹 ↾ (𝐹 “ 𝐶))) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ◡(𝐹 ↾ 𝐶) = (◡𝐹 ↾ (𝐹 “ 𝐶))) |
| 7 | 6 | imaeq1d 6050 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶))) |
| 8 | f1ores 6839 | . . . . 5 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1-onto→(𝐹 “ 𝐶)) | |
| 9 | f1ocnv 6837 | . . . . 5 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1-onto→(𝐹 “ 𝐶) → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶) |
| 11 | imadmrn 6066 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶) “ dom ◡(𝐹 ↾ 𝐶)) = ran ◡(𝐹 ↾ 𝐶) | |
| 12 | f1odm 6828 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → dom ◡(𝐹 ↾ 𝐶) = (𝐹 “ 𝐶)) | |
| 13 | 12 | imaeq2d 6051 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → (◡(𝐹 ↾ 𝐶) “ dom ◡(𝐹 ↾ 𝐶)) = (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶))) |
| 14 | f1ofo 6832 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–onto→𝐶) | |
| 15 | forn 6799 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–onto→𝐶 → ran ◡(𝐹 ↾ 𝐶) = 𝐶) | |
| 16 | 14, 15 | syl 18 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → ran ◡(𝐹 ↾ 𝐶) = 𝐶) |
| 17 | 11, 13, 16 | 3eqtr3a 2819 | . . . 4 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = 𝐶) |
| 18 | 10, 17 | syl 18 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = 𝐶) |
| 19 | 7, 18 | eqtr3d 2797 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶)) = 𝐶) |
| 20 | 1, 19 | eqtr3id 2809 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡𝐹 “ (𝐹 “ 𝐶)) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ⊆ wss 3895 ◡ccnv 5649 dom cdm 5650 ran crn 5651 ↾ cres 5652 “ cima 5653 Fun wfun 6532 ⟶wf 6534 –1-1→wf1 6535 –onto→wfo 6536 –1-1-onto→wf1o 6537 |
| 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-12 2212 ax-ext 2732 ax-sep 5248 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-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 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 4584 df-pr 4586 df-op 4590 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-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 |
| This theorem is used by: f1opw2 7676 mptcnfimad 7998 ssenen 9170 f1opwfi 9345 isf34lem3 10453 subggim 19480 gicsubgen 19493 cnt1 23668 basqtop 24030 tgqtop 24031 hmeoopn 24085 hmeocld 24086 hmeontr 24088 qtopf1 24135 f1otrg 29448 tpr2rico 34544 eulerpartlemmf 35007 ballotlemscr 35151 ballotlemrinv0 35165 f1preimaex 35713 cvmlift2lem9a 36068 grpokerinj 38828 grimcnv 48986 uhgrimedg 48989 isubgr3stgrlem8 49071 |
| Copyright terms: Public domain | W3C validator |