Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fnssresb | GIF version |
Description: Restriction of a function with a subclass of its domain. (Contributed by NM, 10-Oct-2007.) |
Ref | Expression |
---|---|
fnssresb | ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ 𝐵) Fn 𝐵 ↔ 𝐵 ⊆ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-fn 4905 | . 2 ⊢ ((𝐹 ↾ 𝐵) Fn 𝐵 ↔ (Fun (𝐹 ↾ 𝐵) ∧ dom (𝐹 ↾ 𝐵) = 𝐵)) | |
2 | fnfun 4996 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
3 | funres 4941 | . . . . 5 ⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐵)) | |
4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun (𝐹 ↾ 𝐵)) |
5 | 4 | biantrurd 289 | . . 3 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ↾ 𝐵) = 𝐵 ↔ (Fun (𝐹 ↾ 𝐵) ∧ dom (𝐹 ↾ 𝐵) = 𝐵))) |
6 | ssdmres 4633 | . . . 4 ⊢ (𝐵 ⊆ dom 𝐹 ↔ dom (𝐹 ↾ 𝐵) = 𝐵) | |
7 | fndm 4998 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
8 | 7 | sseq2d 2973 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝐵 ⊆ dom 𝐹 ↔ 𝐵 ⊆ 𝐴)) |
9 | 6, 8 | syl5bbr 183 | . . 3 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ↾ 𝐵) = 𝐵 ↔ 𝐵 ⊆ 𝐴)) |
10 | 5, 9 | bitr3d 179 | . 2 ⊢ (𝐹 Fn 𝐴 → ((Fun (𝐹 ↾ 𝐵) ∧ dom (𝐹 ↾ 𝐵) = 𝐵) ↔ 𝐵 ⊆ 𝐴)) |
11 | 1, 10 | syl5bb 181 | 1 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ 𝐵) Fn 𝐵 ↔ 𝐵 ⊆ 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 = wceq 1243 ⊆ wss 2917 dom cdm 4345 ↾ cres 4347 Fun wfun 4896 Fn wfn 4897 |
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-res 4357 df-fun 4904 df-fn 4905 |
This theorem is referenced by: fnssres 5012 |
Copyright terms: Public domain | W3C validator |