| 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 5975 | . 2 ⊢ ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶)) = (◡𝐹 “ (𝐹 “ 𝐶)) | |
| 2 | df-f1 6504 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
| 3 | 2 | simprbi 496 | . . . . . 6 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹) |
| 4 | 3 | adantr 480 | . . . . 5 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → Fun ◡𝐹) |
| 5 | funcnvres 6578 | . . . . 5 ⊢ (Fun ◡𝐹 → ◡(𝐹 ↾ 𝐶) = (◡𝐹 ↾ (𝐹 “ 𝐶))) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ◡(𝐹 ↾ 𝐶) = (◡𝐹 ↾ (𝐹 “ 𝐶))) |
| 7 | 6 | imaeq1d 6019 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶))) |
| 8 | f1ores 6796 | . . . . 5 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1-onto→(𝐹 “ 𝐶)) | |
| 9 | f1ocnv 6794 | . . . . 5 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1-onto→(𝐹 “ 𝐶) → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶) | |
| 10 | 8, 9 | syl 17 | . . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶) |
| 11 | imadmrn 6030 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶) “ dom ◡(𝐹 ↾ 𝐶)) = ran ◡(𝐹 ↾ 𝐶) | |
| 12 | f1odm 6786 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → dom ◡(𝐹 ↾ 𝐶) = (𝐹 “ 𝐶)) | |
| 13 | 12 | imaeq2d 6020 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → (◡(𝐹 ↾ 𝐶) “ dom ◡(𝐹 ↾ 𝐶)) = (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶))) |
| 14 | f1ofo 6789 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → ◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–onto→𝐶) | |
| 15 | forn 6757 | . . . . . 6 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–onto→𝐶 → ran ◡(𝐹 ↾ 𝐶) = 𝐶) | |
| 16 | 14, 15 | syl 17 | . . . . 5 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → ran ◡(𝐹 ↾ 𝐶) = 𝐶) |
| 17 | 11, 13, 16 | 3eqtr3a 2788 | . . . 4 ⊢ (◡(𝐹 ↾ 𝐶):(𝐹 “ 𝐶)–1-1-onto→𝐶 → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = 𝐶) |
| 18 | 10, 17 | syl 17 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡(𝐹 ↾ 𝐶) “ (𝐹 “ 𝐶)) = 𝐶) |
| 19 | 7, 18 | eqtr3d 2766 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → ((◡𝐹 ↾ (𝐹 “ 𝐶)) “ (𝐹 “ 𝐶)) = 𝐶) |
| 20 | 1, 19 | eqtr3id 2778 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (◡𝐹 “ (𝐹 “ 𝐶)) = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ⊆ wss 3911 ◡ccnv 5630 dom cdm 5631 ran crn 5632 ↾ cres 5633 “ cima 5634 Fun wfun 6493 ⟶wf 6495 –1-1→wf1 6496 –onto→wfo 6497 –1-1-onto→wf1o 6498 |
| 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-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pr 5382 |
| 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-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3403 df-v 3446 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-sn 4586 df-pr 4588 df-op 4592 df-br 5103 df-opab 5165 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 |
| This theorem is referenced by: f1opw2 7624 mptcnfimad 7944 ssenen 9092 f1opwfi 9283 isf34lem3 10304 subggim 19180 gicsubgen 19193 cnt1 23270 basqtop 23631 tgqtop 23632 hmeoopn 23686 hmeocld 23687 hmeontr 23689 qtopf1 23736 f1otrg 28851 tpr2rico 33895 eulerpartlemmf 34359 ballotlemscr 34503 ballotlemrinv0 34517 cvmlift2lem9a 35283 grpokerinj 37880 grimcnv 47881 uhgrimedg 47884 isubgr3stgrlem8 47965 |
| Copyright terms: Public domain | W3C validator |