Theorem ofresid 29444

Description: Applying an operation restricted to the range of the functions does not change the function operation. (Contributed by Thierry Arnoux, 14-Feb-2018.)

Hypotheses

Ref	Expression
ofresid.1	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
ofresid.2	⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
ofresid.3	⊢ (𝜑 → 𝐴 ∈ 𝑉)

Assertion

Ref	Expression
ofresid	⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝐹 ∘𝑓 (𝑅 ↾ (𝐵 × 𝐵))𝐺))

Proof of Theorem ofresid

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ofresid.1	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2	1	ffvelrnda 6359	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵)
3		ofresid.2	. . . . . . . 8 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
4	3	ffvelrnda 6359	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝐵)
5		opelxp 5146	. . . . . . 7 ⊢ (⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝐵 × 𝐵) ↔ ((𝐹‘𝑥) ∈ 𝐵 ∧ (𝐺‘𝑥) ∈ 𝐵))
6	2, 4, 5	sylanbrc 698	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝐵 × 𝐵))
7		fvres 6207	. . . . . 6 ⊢ (⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩ ∈ (𝐵 × 𝐵) → ((𝑅 ↾ (𝐵 × 𝐵))‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩) = (𝑅‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩))
8	6, 7	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑅 ↾ (𝐵 × 𝐵))‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩) = (𝑅‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩))
9	8	eqcomd 2628	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩) = ((𝑅 ↾ (𝐵 × 𝐵))‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩))
10		df-ov 6653	. . . 4 ⊢ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝑅‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩)
11		df-ov 6653	. . . 4 ⊢ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)) = ((𝑅 ↾ (𝐵 × 𝐵))‘⟨(𝐹‘𝑥), (𝐺‘𝑥)⟩)
12	9, 10, 11	3eqtr4g 2681	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥)))
13	12	mpteq2dva 4744	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥))))
14		ffn 6045	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
15	1, 14	syl 17	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴)
16		ffn 6045	. . . 4 ⊢ (𝐺:𝐴⟶𝐵 → 𝐺 Fn 𝐴)
17	3, 16	syl 17	. . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴)
18		ofresid.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
19		inidm 3822	. . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴
20		eqidd 2623	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥))
21		eqidd 2623	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = (𝐺‘𝑥))
22	15, 17, 18, 18, 19, 20, 21	offval 6904	. 2 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
23	15, 17, 18, 18, 19, 20, 21	offval 6904	. 2 ⊢ (𝜑 → (𝐹 ∘𝑓 (𝑅 ↾ (𝐵 × 𝐵))𝐺) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)(𝑅 ↾ (𝐵 × 𝐵))(𝐺‘𝑥))))
24	13, 22, 23	3eqtr4d 2666	1 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝐹 ∘𝑓 (𝑅 ↾ (𝐵 × 𝐵))𝐺))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ⟨cop 4183   ↦ cmpt 4729   × cxp 5112   ↾ cres 5116   Fn wfn 5883  ⟶wf 5884  ‘cfv 5888  (class class class)co 6650   ∘_𝑓 cof 6895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-of 6897

This theorem is referenced by:  sitmcl  30413