| 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 6014 | . 2 ⊢ ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶)) = (◡𝐹 “ (𝐹 “ 𝐶)) | |
| 2 | df-f1 6541 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
| 3 | 2 | simprbi 502 | . . . . . 6 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹) |
| 4 | 3 | adantr 485 | . . . . 5 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → Fun ◡𝐹) |
| 5 | funcnvres 6614 | . . . . 5 ⊢ (Fun ◡𝐹 → ◡(𝐹 ↾ 𝐶) = (◡𝐹 ↾ (𝐹 “ 𝐶))) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ◡(𝐹 ↾ 𝐶) = (◡𝐹 ↾ (𝐹 “ 𝐶))) |
| 7 | 6 | imaeq1d 6061 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶))) |
| 8 | f1ores 6835 | . . . . 5 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1-onto→(𝐹 “ 𝐶)) | |
| 9 | f1ocnv 6833 | . . . . 5 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1-onto→(𝐹 “ 𝐶) → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶) |
| 11 | imadmrn 6072 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶) “ dom ◡(𝐹 ↾ 𝐶)) = ran ◡(𝐹 ↾ 𝐶) | |
| 12 | f1odm 6824 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → dom ◡(𝐹 ↾ 𝐶) = (𝐹 “ 𝐶)) | |
| 13 | 12 | imaeq2d 6062 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → (◡(𝐹 ↾ 𝐶) “ dom ◡(𝐹 ↾ 𝐶)) = (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶))) |
| 14 | f1ofo 6828 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–onto→𝐶) | |
| 15 | forn 6795 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–onto→𝐶 → ran ◡(𝐹 ↾ 𝐶) = 𝐶) | |
| 16 | 14, 15 | syl 18 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → ran ◡(𝐹 ↾ 𝐶) = 𝐶) |
| 17 | 11, 13, 16 | 3eqtr3a 2822 | . . . 4 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = 𝐶) |
| 18 | 10, 17 | syl 18 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = 𝐶) |
| 19 | 7, 18 | eqtr3d 2800 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶)) = 𝐶) |
| 20 | 1, 19 | eqtr3id 2812 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡𝐹 “ (𝐹 “ 𝐶)) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1570 ⊆ wss 3905 ◡ccnv 5660 dom cdm 5661 ran crn 5662 ↾ cres 5663 “ cima 5664 Fun wfun 6530 ⟶wf 6532 –1-1→wf1 6533 –onto→wfo 6534 –1-1-onto→wf1o 6535 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 |
| This theorem is used by: f1opw2 7665 mptcnfimad 7979 ssenen 9135 f1opwfi 9309 isf34lem3 10363 subggim 19340 gicsubgen 19353 cnt1 23516 basqtop 23877 tgqtop 23878 hmeoopn 23932 hmeocld 23933 hmeontr 23935 qtopf1 23982 f1otrg 29229 tpr2rico 34311 eulerpartlemmf 34774 ballotlemscr 34918 ballotlemrinv0 34932 cvmlift2lem9a 35803 grpokerinj 38572 grimcnv 48681 uhgrimedg 48684 isubgr3stgrlem8 48766 |
| Copyright terms: Public domain | W3C validator |