![]() |
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 5251 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵) | |
2 | fssres 5221 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) | |
3 | 1, 2 | sylan 278 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) |
4 | df-f1 5054 | . . . . 5 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
5 | 4 | simprbi 270 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹) |
6 | funres11 5120 | . . . 4 ⊢ (Fun ◡𝐹 → Fun ◡(𝐹 ↾ 𝐶)) | |
7 | 5, 6 | syl 14 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡(𝐹 ↾ 𝐶)) |
8 | 7 | adantr 271 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → Fun ◡(𝐹 ↾ 𝐶)) |
9 | df-f1 5054 | . 2 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ↔ ((𝐹 ↾ 𝐶):𝐶⟶𝐵 ∧ Fun ◡(𝐹 ↾ 𝐶))) | |
10 | 3, 8, 9 | sylanbrc 409 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ⊆ wss 3013 ◡ccnv 4466 ↾ cres 4469 Fun wfun 5043 ⟶wf 5045 –1-1→wf1 5046 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 668 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-10 1448 ax-11 1449 ax-i12 1450 ax-bndl 1451 ax-4 1452 ax-14 1457 ax-17 1471 ax-i9 1475 ax-ial 1479 ax-i5r 1480 ax-ext 2077 ax-sep 3978 ax-pow 4030 ax-pr 4060 |
This theorem depends on definitions: df-bi 116 df-3an 929 df-tru 1299 df-nf 1402 df-sb 1700 df-clab 2082 df-cleq 2088 df-clel 2091 df-nfc 2224 df-ral 2375 df-rex 2376 df-v 2635 df-un 3017 df-in 3019 df-ss 3026 df-pw 3451 df-sn 3472 df-pr 3473 df-op 3475 df-br 3868 df-opab 3922 df-xp 4473 df-rel 4474 df-cnv 4475 df-co 4476 df-dm 4477 df-rn 4478 df-res 4479 df-fun 5051 df-fn 5052 df-f 5053 df-f1 5054 |
This theorem is referenced by: f1resf1 5261 f1ores 5303 |
Copyright terms: Public domain | W3C validator |