| 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 6785 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) | |
| 2 | 1 | 3adant3 1150 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
| 3 | frn 6715 | . . 3 ⊢ ((𝐹 ↾ 𝐶):𝐶⟶𝐷 → ran (𝐹 ↾ 𝐶) ⊆ 𝐷) | |
| 4 | 3 | 3ad2ant3 1153 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → ran (𝐹 ↾ 𝐶) ⊆ 𝐷) |
| 5 | f1ssr 6784 | . 2 ⊢ (((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ∧ ran (𝐹 ↾ 𝐶) ⊆ 𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐷) | |
| 6 | 2, 4, 5 | syl2anc 595 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1103 ⊆ wss 3906 ran crn 5664 ↾ cres 5665 ⟶wf 6534 –1-1→wf1 6535 |
| 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 5258 ax-pr 5406 |
| 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 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-br 5111 df-opab 5175 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 |
| This theorem is referenced by: inlresf1 9902 inrresf1 9904 pfxf1 33243 aks6d1c2 42878 3f1oss1 47795 |
| Copyright terms: Public domain | W3C validator |