Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > funcnvres | GIF version |
Description: The converse of a restricted function. (Contributed by NM, 27-Mar-1998.) |
Ref | Expression |
---|---|
funcnvres | ⊢ (Fun ◡𝐹 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ (𝐹 “ 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ima 4358 | . . . 4 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴) | |
2 | df-rn 4356 | . . . 4 ⊢ ran (𝐹 ↾ 𝐴) = dom ◡(𝐹 ↾ 𝐴) | |
3 | 1, 2 | eqtri 2060 | . . 3 ⊢ (𝐹 “ 𝐴) = dom ◡(𝐹 ↾ 𝐴) |
4 | 3 | reseq2i 4609 | . 2 ⊢ (◡𝐹 ↾ (𝐹 “ 𝐴)) = (◡𝐹 ↾ dom ◡(𝐹 ↾ 𝐴)) |
5 | resss 4635 | . . . 4 ⊢ (𝐹 ↾ 𝐴) ⊆ 𝐹 | |
6 | cnvss 4508 | . . . 4 ⊢ ((𝐹 ↾ 𝐴) ⊆ 𝐹 → ◡(𝐹 ↾ 𝐴) ⊆ ◡𝐹) | |
7 | 5, 6 | ax-mp 7 | . . 3 ⊢ ◡(𝐹 ↾ 𝐴) ⊆ ◡𝐹 |
8 | funssres 4942 | . . 3 ⊢ ((Fun ◡𝐹 ∧ ◡(𝐹 ↾ 𝐴) ⊆ ◡𝐹) → (◡𝐹 ↾ dom ◡(𝐹 ↾ 𝐴)) = ◡(𝐹 ↾ 𝐴)) | |
9 | 7, 8 | mpan2 401 | . 2 ⊢ (Fun ◡𝐹 → (◡𝐹 ↾ dom ◡(𝐹 ↾ 𝐴)) = ◡(𝐹 ↾ 𝐴)) |
10 | 4, 9 | syl5req 2085 | 1 ⊢ (Fun ◡𝐹 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ (𝐹 “ 𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1243 ⊆ wss 2917 ◡ccnv 4344 dom cdm 4345 ran crn 4346 ↾ cres 4347 “ cima 4348 Fun wfun 4896 |
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-eu 1903 df-mo 1904 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-id 4030 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-fun 4904 |
This theorem is referenced by: cnvresid 4973 funcnvres2 4974 f1orescnv 5142 f1imacnv 5143 |
Copyright terms: Public domain | W3C validator |