| 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 6810 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) | |
| 2 | 1 | 3adant3 1132 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
| 3 | frn 6742 | . . 3 ⊢ ((𝐹 ↾ 𝐶):𝐶⟶𝐷 → ran (𝐹 ↾ 𝐶) ⊆ 𝐷) | |
| 4 | 3 | 3ad2ant3 1135 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴 ∧ (𝐹 ↾ 𝐶):𝐶⟶𝐷) → ran (𝐹 ↾ 𝐶) ⊆ 𝐷) |
| 5 | f1ssr 6809 | . 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 3950 ran crn 5685 ↾ cres 5686 ⟶wf 6556 –1-1→wf1 6557 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pr 5431 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2714 df-cleq 2728 df-clel 2815 df-ral 3061 df-rex 3070 df-rab 3436 df-v 3481 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-sn 4626 df-pr 4628 df-op 4632 df-br 5143 df-opab 5205 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 |
| This theorem is referenced by: inlresf1 9956 inrresf1 9958 pfxf1 32927 aks6d1c2 42132 3f1oss1 47092 |
| Copyright terms: Public domain | W3C validator |