| 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 5507 | . 2 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → ((𝐹 ↾ 𝐵) ∘ 𝐺):𝐴⟶𝐶) | |
| 2 | frn 5498 | . . . . 5 ⊢ (𝐺:𝐴⟶𝐵 → ran 𝐺 ⊆ 𝐵) | |
| 3 | cores 5247 | . . . . 5 ⊢ (ran 𝐺 ⊆ 𝐵 → ((𝐹 ↾ 𝐵) ∘ 𝐺) = (𝐹 ∘ 𝐺)) | |
| 4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝐺:𝐴⟶𝐵 → ((𝐹 ↾ 𝐵) ∘ 𝐺) = (𝐹 ∘ 𝐺)) |
| 5 | 4 | adantl 277 | . . 3 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → ((𝐹 ↾ 𝐵) ∘ 𝐺) = (𝐹 ∘ 𝐺)) |
| 6 | 5 | feq1d 5476 | . 2 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → (((𝐹 ↾ 𝐵) ∘ 𝐺):𝐴⟶𝐶 ↔ (𝐹 ∘ 𝐺):𝐴⟶𝐶)) |
| 7 | 1, 6 | mpbid 147 | 1 ⊢ (((𝐹 ↾ 𝐵):𝐵⟶𝐶 ∧ 𝐺:𝐴⟶𝐵) → (𝐹 ∘ 𝐺):𝐴⟶𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ⊆ wss 3201 ran crn 4732 ↾ cres 4733 ∘ ccom 4735 ⟶wf 5329 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-fun 5335 df-fn 5336 df-f 5337 |
| This theorem is referenced by: isomninnlem 16745 iswomninnlem 16765 ismkvnnlem 16768 |
| Copyright terms: Public domain | W3C validator |