Theorem ofvalg 6312

Description: Evaluate a function operation at a point. (Contributed by Mario Carneiro, 20-Jul-2014.) (Revised by Jim Kingdon, 22-Nov-2023.)

Hypotheses

Ref	Expression
offval.1	⊢ (𝜑 → 𝐹 Fn 𝐴)
offval.2	⊢ (𝜑 → 𝐺 Fn 𝐵)
offval.3	⊢ (𝜑 → 𝐴 ∈ 𝑉)
offval.4	⊢ (𝜑 → 𝐵 ∈ 𝑊)
offval.5	⊢ (𝐴 ∩ 𝐵) = 𝑆
ofval.6	⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶)
ofval.7	⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷)
ofval.8	⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐶𝑅𝐷) ∈ 𝑈)

Assertion

Ref	Expression
ofvalg	⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = (𝐶𝑅𝐷))

Proof of Theorem ofvalg

Dummy variable 𝑥 is distinct from all other variables.

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 2239	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥))
7		eqidd 2239	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥))
8	1, 2, 3, 4, 5, 6, 7	offval 6310	. . . 4 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
9	8	fveq1d 5697	. . 3 ⊢ (𝜑 → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋))
10	9	adantr 276	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋))
11		eqid 2238	. . 3 ⊢ (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))
12		fveq2 5695	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
13		fveq2 5695	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋))
14	12, 13	oveq12d 6103	. . 3 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = ((𝐹‘𝑋)𝑅(𝐺‘𝑋)))
15		simpr 110	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆)
16		inss1 3451	. . . . . . . 8 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴
17	5, 16	eqsstrri 3281	. . . . . . 7 ⊢ 𝑆 ⊆ 𝐴
18	17	sseli 3244	. . . . . 6 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐴)
19		ofval.6	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶)
20	18, 19	sylan2 286	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶)
21		inss2 3452	. . . . . . . 8 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
22	5, 21	eqsstrri 3281	. . . . . . 7 ⊢ 𝑆 ⊆ 𝐵
23	22	sseli 3244	. . . . . 6 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ 𝐵)
24		ofval.7	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷)
25	23, 24	sylan2 286	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷)
26	20, 25	oveq12d 6103	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹‘𝑋)𝑅(𝐺‘𝑋)) = (𝐶𝑅𝐷))
27		ofval.8	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → (𝐶𝑅𝐷) ∈ 𝑈)
28	26, 27	eqeltrd 2315	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹‘𝑋)𝑅(𝐺‘𝑋)) ∈ 𝑈)
29	11, 14, 15, 28	fvmptd3 5799	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))‘𝑋) = ((𝐹‘𝑋)𝑅(𝐺‘𝑋)))
30	10, 29, 26	3eqtrd 2275	1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘𝑓 𝑅𝐺)‘𝑋) = (𝐶𝑅𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209   ∩ cin 3219   ↦ cmpt 4192   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085   ∘_𝑓 cof 6300

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302

This theorem is used by:  offeq  6316  ofc1g  6324  ofc2g  6325  suppofss1dcl  6504  suppofss2dcl  6505  ofnegsub  9295  psrbagcon  15146  psrbagconf1o  15149  mplsubgfilemcl  15181  dvaddxxbr  15893  dvmulxxbr  15894  plyaddlem1  15939