| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fimadmfoALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of fimadmfo 6801, based on fores 6802. A function is a function onto the image of its domain. (Contributed by AV, 1-Dec-2022.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| fimadmfoALT | ⊢ (𝐹:𝐴⟶𝐵 → 𝐹:𝐴–onto→(𝐹 “ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fdm 6715 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
| 2 | frel 6711 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → Rel 𝐹) | |
| 3 | resdm 6025 | . . . . . 6 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹) | |
| 4 | 3 | eqcomd 2769 | . . . . 5 ⊢ (Rel 𝐹 → 𝐹 = (𝐹 ↾ dom 𝐹)) |
| 5 | 2, 4 | syl 18 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 = (𝐹 ↾ dom 𝐹)) |
| 6 | reseq2 5973 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → (𝐹 ↾ dom 𝐹) = (𝐹 ↾ 𝐴)) | |
| 7 | 5, 6 | sylan9eq 2818 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ dom 𝐹 = 𝐴) → 𝐹 = (𝐹 ↾ 𝐴)) |
| 8 | 1, 7 | mpdan 699 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 = (𝐹 ↾ 𝐴)) |
| 9 | ffun 6708 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹) | |
| 10 | eqimss2 3996 | . . . . . . 7 ⊢ (dom 𝐹 = 𝐴 → 𝐴 ⊆ dom 𝐹) | |
| 11 | 1, 10 | syl 18 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐴 ⊆ dom 𝐹) |
| 12 | 9, 11 | jca 520 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) |
| 13 | 12 | adantr 485 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐹 = (𝐹 ↾ 𝐴)) → (Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) |
| 14 | fores 6802 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴)) | |
| 15 | 13, 14 | syl 18 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐹 = (𝐹 ↾ 𝐴)) → (𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴)) |
| 16 | foeq1 6788 | . . . 4 ⊢ (𝐹 = (𝐹 ↾ 𝐴) → (𝐹:𝐴–onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴))) | |
| 17 | 16 | adantl 486 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐹 = (𝐹 ↾ 𝐴)) → (𝐹:𝐴–onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–onto→(𝐹 “ 𝐴))) |
| 18 | 15, 17 | mpbird 260 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐹 = (𝐹 ↾ 𝐴)) → 𝐹:𝐴–onto→(𝐹 “ 𝐴)) |
| 19 | 8, 18 | mpdan 699 | 1 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹:𝐴–onto→(𝐹 “ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ⊆ wss 3905 dom cdm 5661 ↾ cres 5663 “ cima 5664 Rel wrel 5666 Fun wfun 6530 ⟶wf 6532 –onto→wfo 6534 |
| This theorem was proved from 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-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem 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-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-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-fo 6542 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |