![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fco2 | GIF version |
Description: Functionality of a composition with weakened out of domain condition on the first argument. (Contributed by Stefan O'Rear, 11-Mar-2015.) |
Ref | Expression |
---|---|
fco2 | ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → (𝐹 ∘ 𝐺):𝐴⟶𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fco 5107 | . 2 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → ((𝐹 ↾ 𝐵) ∘ 𝐺):𝐴⟶𝐶) | |
2 | frn 5103 | . . . . 5 ⊢ (𝐺:𝐴⟶𝐵 → ran 𝐺 ⊆ 𝐵) | |
3 | cores 4874 | . . . . 5 ⊢ (ran 𝐺 ⊆ 𝐵 → ((𝐹 ↾ 𝐵) ∘ 𝐺) = (𝐹 ∘ 𝐺)) | |
4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝐺:𝐴⟶𝐵 → ((𝐹 ↾ 𝐵) ∘ 𝐺) = (𝐹 ∘ 𝐺)) |
5 | 4 | adantl 271 | . . 3 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → ((𝐹 ↾ 𝐵) ∘ 𝐺) = (𝐹 ∘ 𝐺)) |
6 | 5 | feq1d 5085 | . 2 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → (((𝐹 ↾ 𝐵) ∘ 𝐺):𝐴⟶𝐶 ↔ (𝐹 ∘ 𝐺):𝐴⟶𝐶)) |
7 | 1, 6 | mpbid 145 | 1 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → (𝐹 ∘ 𝐺):𝐴⟶𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 = wceq 1285 ⊆ wss 2982 ran crn 4392 ↾ cres 4393 ∘ ccom 4395 ⟶wf 4948 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2065 ax-sep 3916 ax-pow 3968 ax-pr 3992 |
This theorem depends on definitions: df-bi 115 df-3an 922 df-tru 1288 df-nf 1391 df-sb 1688 df-eu 1946 df-mo 1947 df-clab 2070 df-cleq 2076 df-clel 2079 df-nfc 2212 df-ral 2358 df-rex 2359 df-v 2612 df-un 2986 df-in 2988 df-ss 2995 df-pw 3402 df-sn 3422 df-pr 3423 df-op 3425 df-br 3806 df-opab 3860 df-id 4076 df-xp 4397 df-rel 4398 df-cnv 4399 df-co 4400 df-dm 4401 df-rn 4402 df-res 4403 df-fun 4954 df-fn 4955 df-f 4956 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |