Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > f1ssres | GIF version |
Description: A function that is one-to-one is also one-to-one on any subclass of its domain. (Contributed by Mario Carneiro, 17-Jan-2015.) |
Ref | Expression |
---|---|
f1ssres | ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1f 5403 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵) | |
2 | fssres 5373 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) | |
3 | 1, 2 | sylan 281 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) |
4 | df-f1 5203 | . . . . 5 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
5 | 4 | simprbi 273 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹) |
6 | funres11 5270 | . . . 4 ⊢ (Fun ◡𝐹 → Fun ◡(𝐹 ↾ 𝐶)) | |
7 | 5, 6 | syl 14 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡(𝐹 ↾ 𝐶)) |
8 | 7 | adantr 274 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → Fun ◡(𝐹 ↾ 𝐶)) |
9 | df-f1 5203 | . 2 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ↔ ((𝐹 ↾ 𝐶):𝐶⟶𝐵 ∧ Fun ◡(𝐹 ↾ 𝐶))) | |
10 | 3, 8, 9 | sylanbrc 415 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ⊆ wss 3121 ◡ccnv 4610 ↾ cres 4613 Fun wfun 5192 ⟶wf 5194 –1-1→wf1 5195 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-v 2732 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-br 3990 df-opab 4051 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 |
This theorem is referenced by: f1resf1 5413 f1ores 5457 |
Copyright terms: Public domain | W3C validator |