![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ofvalg | GIF version |
Description: Evaluate a function operation at a point. (Contributed by Mario Carneiro, 20-Jul-2014.) (Revised by Jim Kingdon, 22-Nov-2023.) |
Ref | Expression |
---|---|
offval.1 | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
offval.2 | ⊢ (𝜑 → 𝐺 Fn 𝐵) |
offval.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
offval.4 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
offval.5 | ⊢ (𝐴 ∩ 𝐵) = 𝑆 |
ofval.6 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) |
ofval.7 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) |
ofval.8 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐶𝑅𝐷) ∈ 𝑈) |
Ref | Expression |
---|---|
ofvalg | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = (𝐶𝑅𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | offval.1 | . . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
2 | offval.2 | . . . . 5 ⊢ (𝜑 → 𝐺 Fn 𝐵) | |
3 | offval.3 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
4 | offval.4 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
5 | offval.5 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) = 𝑆 | |
6 | eqidd 2194 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
7 | eqidd 2194 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
8 | 1, 2, 3, 4, 5, 6, 7 | offval 6138 | . . . 4 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))) |
9 | 8 | fveq1d 5556 | . . 3 ⊢ (𝜑 → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋)) |
10 | 9 | adantr 276 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋)) |
11 | eqid 2193 | . . 3 ⊢ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) | |
12 | fveq2 5554 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
13 | fveq2 5554 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
14 | 12, 13 | oveq12d 5936 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = ((𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
15 | simpr 110 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
16 | inss1 3379 | . . . . . . . 8 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
17 | 5, 16 | eqsstrri 3212 | . . . . . . 7 ⊢ 𝑆 ⊆ 𝐴 |
18 | 17 | sseli 3175 | . . . . . 6 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐴) |
19 | ofval.6 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) | |
20 | 18, 19 | sylan2 286 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶) |
21 | inss2 3380 | . . . . . . . 8 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
22 | 5, 21 | eqsstrri 3212 | . . . . . . 7 ⊢ 𝑆 ⊆ 𝐵 |
23 | 22 | sseli 3175 | . . . . . 6 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐵) |
24 | ofval.7 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) | |
25 | 23, 24 | sylan2 286 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷) |
26 | 20, 25 | oveq12d 5936 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹‘𝑋)𝑅(𝐺‘𝑋)) = (𝐶𝑅𝐷)) |
27 | ofval.8 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐶𝑅𝐷) ∈ 𝑈) | |
28 | 26, 27 | eqeltrd 2270 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹‘𝑋)𝑅(𝐺‘𝑋)) ∈ 𝑈) |
29 | 11, 14, 15, 28 | fvmptd3 5651 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋) = ((𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
30 | 10, 29, 26 | 3eqtrd 2230 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = (𝐶𝑅𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 ∩ cin 3152 ↦ cmpt 4090 Fn wfn 5249 ‘cfv 5254 (class class class)co 5918 ∘𝑓 cof 6128 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-setind 4569 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-ov 5921 df-oprab 5922 df-mpo 5923 df-of 6130 |
This theorem is referenced by: offeq 6144 ofc1g 6151 ofc2g 6152 ofnegsub 8981 gsumfzmptfidmadd 13409 dvaddxxbr 14850 dvmulxxbr 14851 plyaddlem1 14893 |
Copyright terms: Public domain | W3C validator |