| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ofres | GIF version | ||
| Description: Restrict the operands of a function operation to the same domain as that of the operation itself. (Contributed by Mario Carneiro, 15-Sep-2014.) |
| Ref | Expression |
|---|---|
| ofres.1 | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| ofres.2 | ⊢ (𝜑 → 𝐺 Fn 𝐵) |
| ofres.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| ofres.4 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| ofres.5 | ⊢ (𝐴 ∩ 𝐵) = 𝐶 |
| Ref | Expression |
|---|---|
| ofres | ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = ((𝐹 ↾ 𝐶) ∘𝑓 𝑅(𝐺 ↾ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ofres.1 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 2 | ofres.2 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐵) | |
| 3 | ofres.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 4 | ofres.4 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 5 | ofres.5 | . . 3 ⊢ (𝐴 ∩ 𝐵) = 𝐶 | |
| 6 | eqidd 2232 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 7 | eqidd 2232 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | offval 6242 | . 2 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 9 | inss1 3427 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 10 | 5, 9 | eqsstrri 3260 | . . . 4 ⊢ 𝐶 ⊆ 𝐴 |
| 11 | fnssres 5445 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶) Fn 𝐶) | |
| 12 | 1, 10, 11 | sylancl 413 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) Fn 𝐶) |
| 13 | inss2 3428 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 14 | 5, 13 | eqsstrri 3260 | . . . 4 ⊢ 𝐶 ⊆ 𝐵 |
| 15 | fnssres 5445 | . . . 4 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐶 ⊆ 𝐵) → (𝐺 ↾ 𝐶) Fn 𝐶) | |
| 16 | 2, 14, 15 | sylancl 413 | . . 3 ⊢ (𝜑 → (𝐺 ↾ 𝐶) Fn 𝐶) |
| 17 | ssexg 4228 | . . . 4 ⊢ ((𝐶 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐶 ∈ V) | |
| 18 | 10, 3, 17 | sylancr 414 | . . 3 ⊢ (𝜑 → 𝐶 ∈ V) |
| 19 | inidm 3416 | . . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶 | |
| 20 | fvres 5663 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) | |
| 21 | 20 | adantl 277 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) |
| 22 | fvres 5663 | . . . 4 ⊢ (𝑥 ∈ 𝐶 → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) | |
| 23 | 22 | adantl 277 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ↾ 𝐶)‘𝑥) = (𝐺‘𝑥)) |
| 24 | 12, 16, 18, 18, 19, 21, 23 | offval 6242 | . 2 ⊢ (𝜑 → ((𝐹 ↾ 𝐶) ∘𝑓 𝑅(𝐺 ↾ 𝐶)) = (𝑥 ∈ 𝐶 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
| 25 | 8, 24 | eqtr4d 2267 | 1 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = ((𝐹 ↾ 𝐶) ∘𝑓 𝑅(𝐺 ↾ 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 Vcvv 2802 ∩ cin 3199 ⊆ wss 3200 ↦ cmpt 4150 ↾ cres 4727 Fn wfn 5321 ‘cfv 5326 (class class class)co 6017 ∘𝑓 cof 6232 |
| 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-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-setind 4635 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6020 df-oprab 6021 df-mpo 6022 df-of 6234 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |