![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ofc12 | GIF version |
Description: Function operation on two constant functions. (Contributed by Mario Carneiro, 28-Jul-2014.) |
Ref | Expression |
---|---|
ofc12.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
ofc12.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
ofc12.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑋) |
Ref | Expression |
---|---|
ofc12 | ⊢ (𝜑 → ((𝐴 × {𝐵}) ∘𝑓 𝑅(𝐴 × {𝐶})) = (𝐴 × {(𝐵𝑅𝐶)})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ofc12.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
2 | ofc12.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
3 | 2 | adantr 271 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊) |
4 | ofc12.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑋) | |
5 | 4 | adantr 271 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑋) |
6 | fconstmpt 4498 | . . . 4 ⊢ (𝐴 × {𝐵}) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
7 | 6 | a1i 9 | . . 3 ⊢ (𝜑 → (𝐴 × {𝐵}) = (𝑥 ∈ 𝐴 ↦ 𝐵)) |
8 | fconstmpt 4498 | . . . 4 ⊢ (𝐴 × {𝐶}) = (𝑥 ∈ 𝐴 ↦ 𝐶) | |
9 | 8 | a1i 9 | . . 3 ⊢ (𝜑 → (𝐴 × {𝐶}) = (𝑥 ∈ 𝐴 ↦ 𝐶)) |
10 | 1, 3, 5, 7, 9 | offval2 5884 | . 2 ⊢ (𝜑 → ((𝐴 × {𝐵}) ∘𝑓 𝑅(𝐴 × {𝐶})) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶))) |
11 | fconstmpt 4498 | . 2 ⊢ (𝐴 × {(𝐵𝑅𝐶)}) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)) | |
12 | 10, 11 | syl6eqr 2139 | 1 ⊢ (𝜑 → ((𝐴 × {𝐵}) ∘𝑓 𝑅(𝐴 × {𝐶})) = (𝐴 × {(𝐵𝑅𝐶)})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1290 ∈ wcel 1439 {csn 3450 ↦ cmpt 3905 × cxp 4449 (class class class)co 5666 ∘𝑓 cof 5868 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 580 ax-in2 581 ax-io 666 ax-5 1382 ax-7 1383 ax-gen 1384 ax-ie1 1428 ax-ie2 1429 ax-8 1441 ax-10 1442 ax-11 1443 ax-i12 1444 ax-bndl 1445 ax-4 1446 ax-14 1451 ax-17 1465 ax-i9 1469 ax-ial 1473 ax-i5r 1474 ax-ext 2071 ax-coll 3960 ax-sep 3963 ax-pow 4015 ax-pr 4045 ax-setind 4366 |
This theorem depends on definitions: df-bi 116 df-3an 927 df-tru 1293 df-fal 1296 df-nf 1396 df-sb 1694 df-eu 1952 df-mo 1953 df-clab 2076 df-cleq 2082 df-clel 2085 df-nfc 2218 df-ne 2257 df-ral 2365 df-rex 2366 df-reu 2367 df-rab 2369 df-v 2622 df-sbc 2842 df-csb 2935 df-dif 3002 df-un 3004 df-in 3006 df-ss 3013 df-pw 3435 df-sn 3456 df-pr 3457 df-op 3459 df-uni 3660 df-iun 3738 df-br 3852 df-opab 3906 df-mpt 3907 df-id 4129 df-xp 4457 df-rel 4458 df-cnv 4459 df-co 4460 df-dm 4461 df-rn 4462 df-res 4463 df-ima 4464 df-iota 4993 df-fun 5030 df-fn 5031 df-f 5032 df-f1 5033 df-fo 5034 df-f1o 5035 df-fv 5036 df-ov 5669 df-oprab 5670 df-mpt2 5671 df-of 5870 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |