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 some aubset of its domain. (Contributed by Mario Carneiro, 17-Jan-2015.) |
Ref | Expression |
---|---|
f1ssres | ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1f 5092 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵) | |
2 | fssres 5066 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) | |
3 | 1, 2 | sylan 267 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) |
4 | df-f1 4907 | . . . . 5 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
5 | 4 | simprbi 260 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹) |
6 | funres11 4971 | . . . 4 ⊢ (Fun ◡𝐹 → Fun ◡(𝐹 ↾ 𝐶)) | |
7 | 5, 6 | syl 14 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡(𝐹 ↾ 𝐶)) |
8 | 7 | adantr 261 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → Fun ◡(𝐹 ↾ 𝐶)) |
9 | df-f1 4907 | . 2 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ↔ ((𝐹 ↾ 𝐶):𝐶⟶𝐵 ∧ Fun ◡(𝐹 ↾ 𝐶))) | |
10 | 3, 8, 9 | sylanbrc 394 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ⊆ wss 2917 ◡ccnv 4344 ↾ cres 4347 Fun wfun 4896 ⟶wf 4898 –1-1→wf1 4899 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-br 3765 df-opab 3819 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 |
This theorem is referenced by: f1ores 5141 |
Copyright terms: Public domain | W3C validator |