Theorem ofrco 32966

Description: Function relation between function compositions. (Contributed by Thierry Arnoux, 15-Jan-2026.)

Hypotheses

Ref	Expression
ofrco.1	⊢ (𝜑 → 𝐹 Fn 𝐴)
ofrco.2	⊢ (𝜑 → 𝐺 Fn 𝐴)
ofrco.3	⊢ (𝜑 → 𝐻:𝐶⟶𝐴)
ofrco.4	⊢ (𝜑 → 𝐴 ∈ 𝑉)
ofrco.5	⊢ (𝜑 → 𝐶 ∈ 𝑊)
ofrco.6	⊢ (𝜑 → 𝐹 ∘r 𝑅𝐺)

Assertion

Ref	Expression
ofrco	⊢ (𝜑 → (𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻))

Proof of Theorem ofrco

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6881	. . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐹‘𝑦) = (𝐹‘(𝐻‘𝑥)))
2		fveq2 6881	. . . . 5 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐺‘𝑦) = (𝐺‘(𝐻‘𝑥)))
3	1, 2	breq12d 5121	. . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → ((𝐹‘𝑦)𝑅(𝐺‘𝑦) ↔ (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))))
4		ofrco.6	. . . . . 6 ⊢ (𝜑 → 𝐹 ∘r 𝑅𝐺)
5		ofrco.1	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴)
6		ofrco.2	. . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴)
7		ofrco.4	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
8		inidm 4178	. . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴
9		eqidd 2763	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦))
10		eqidd 2763	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦))
11	5, 6, 7, 7, 8, 9, 10	ofrfval 7686	. . . . . 6 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦)))
12	4, 11	mpbid 235	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦))
13	12	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦)𝑅(𝐺‘𝑦))
14		ofrco.3	. . . . 5 ⊢ (𝜑 → 𝐻:𝐶⟶𝐴)
15	14	ffvelcdmda 7079	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐻‘𝑥) ∈ 𝐴)
16	3, 13, 15	rspcdva 3581	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))
17	16	ralrimiva 3156	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))
18		fnfco 6743	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐹 ∘ 𝐻) Fn 𝐶)
19	5, 14, 18	syl2anc 595	. . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐻) Fn 𝐶)
20		fnfco 6743	. . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐻:𝐶⟶𝐴) → (𝐺 ∘ 𝐻) Fn 𝐶)
21	6, 14, 20	syl2anc 595	. . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐻) Fn 𝐶)
22		ofrco.5	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊)
23		inidm 4178	. . 3 ⊢ (𝐶 ∩ 𝐶) = 𝐶
24	14	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐻:𝐶⟶𝐴)
25		simpr 489	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶)
26	24, 25	fvco3d 6982	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥)))
27	24, 25	fvco3d 6982	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥)))
28	19, 21, 22, 22, 23, 26, 27	ofrfval 7686	. 2 ⊢ (𝜑 → ((𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻) ↔ ∀𝑥 ∈ 𝐶 (𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))))
29	17, 28	mpbird 260	1 ⊢ (𝜑 → (𝐹 ∘ 𝐻) ∘r 𝑅(𝐺 ∘ 𝐻))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∀wral 3078   class class class wbr 5108   ∘ ccom 5664   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536   ∘_r cofr 7675

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ofr 7677

This theorem is used by:  mplvrpmrhm  33946