Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > f1ssr | GIF version |
Description: Combine a one-to-one function with a restriction on the domain. (Contributed by Stefan O'Rear, 20-Feb-2015.) |
Ref | Expression |
---|---|
f1ssr | ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹:𝐴–1-1→𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1fn 5093 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 Fn 𝐴) | |
2 | 1 | adantr 261 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹 Fn 𝐴) |
3 | simpr 103 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → ran 𝐹 ⊆ 𝐶) | |
4 | df-f 4906 | . . 3 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶)) | |
5 | 2, 3, 4 | sylanbrc 394 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹:𝐴⟶𝐶) |
6 | df-f1 4907 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
7 | 6 | simprbi 260 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ◡𝐹) |
8 | 7 | adantr 261 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → Fun ◡𝐹) |
9 | df-f1 4907 | . 2 ⊢ (𝐹:𝐴–1-1→𝐶 ↔ (𝐹:𝐴⟶𝐶 ∧ Fun ◡𝐹)) | |
10 | 5, 8, 9 | sylanbrc 394 | 1 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 ⊆ 𝐶) → 𝐹:𝐴–1-1→𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ⊆ wss 2917 ◡ccnv 4344 ran crn 4346 Fun wfun 4896 Fn wfn 4897 ⟶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 |
This theorem depends on definitions: df-bi 110 df-f 4906 df-f1 4907 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |