| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1resf1 | Structured version Visualization version GIF version | ||
| Description: The restriction of an injective function is injective. (Contributed by AV, 28-Jun-2022.) |
| Ref | Expression |
|---|---|
| f1resf1 | ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1ssres 6731 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) | |
| 2 | 1 | 3adant3 1132 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
| 3 | frn 6663 | . . 3 ⊢ ((𝐹 ↾ 𝐶):𝐶⟶𝐷 → ran (𝐹 ↾ 𝐶) ⊆ 𝐷) | |
| 4 | 3 | 3ad2ant3 1135 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → ran (𝐹 ↾ 𝐶) ⊆ 𝐷) |
| 5 | f1ssr 6730 | . 2 ⊢ (((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ∧ ran (𝐹 ↾ 𝐶) ⊆ 𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐷) | |
| 6 | 2, 4, 5 | syl2anc 584 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 ⊆ wss 3898 ran crn 5620 ↾ cres 5621 ⟶wf 6482 –1-1→wf1 6483 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-sn 4576 df-pr 4578 df-op 4582 df-br 5094 df-opab 5156 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 |
| This theorem is referenced by: inlresf1 9815 inrresf1 9817 pfxf1 32930 aks6d1c2 42243 3f1oss1 47199 |
| Copyright terms: Public domain | W3C validator |