Theorem fmpocos 42229

Description: Composition of two functions. Variation of fmpoco 8077 with more context in the substitution hypothesis for 𝑇. (Contributed by SN, 14-Mar-2025.)

Hypotheses

Ref	Expression
fmpocos.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑅 ∈ 𝐶)
fmpocos.2	⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅))
fmpocos.3	⊢ (𝜑 → 𝐺 = (𝑧 ∈ 𝐶 ↦ 𝑆))
fmpocos.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ⦋𝑅 / 𝑧⦌𝑆 = 𝑇)

Assertion

Ref	Expression
fmpocos	⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑇))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑧,𝐶,𝑦   𝜑,𝑥,𝑦   𝑥,𝑆,𝑦   𝑥,𝐴,𝑦   𝑧,𝑅   𝑧,𝑇

Allowed substitution hints:   𝜑(𝑧)   𝐴(𝑧)   𝐵(𝑧)   𝑅(𝑥,𝑦)   𝑆(𝑧)   𝑇(𝑥,𝑦)   𝐹(𝑥,𝑦,𝑧)   𝐺(𝑥,𝑦,𝑧)

Proof of Theorem fmpocos

Dummy variables 𝑣 𝑢 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fmpocos.1	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑅 ∈ 𝐶)
2	1	ralrimivva 3181	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑅 ∈ 𝐶)
3		eqid 2730	. . . . . 6 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅)
4	3	fmpo 8050	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑅 ∈ 𝐶 ↔ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅):(𝐴 × 𝐵)⟶𝐶)
5	2, 4	sylib 218	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅):(𝐴 × 𝐵)⟶𝐶)
6		nfcv 2892	. . . . . . 7 ⊢ Ⅎ𝑢𝑅
7		nfcv 2892	. . . . . . 7 ⊢ Ⅎ𝑣𝑅
8		nfcv 2892	. . . . . . . 8 ⊢ Ⅎ𝑥𝑣
9		nfcsb1v 3889	. . . . . . . 8 ⊢ Ⅎ𝑥⦋𝑢 / 𝑥⦌𝑅
10	8, 9	nfcsbw 3891	. . . . . . 7 ⊢ Ⅎ𝑥⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅
11		nfcsb1v 3889	. . . . . . 7 ⊢ Ⅎ𝑦⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅
12		csbeq1a 3879	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → 𝑅 = ⦋𝑢 / 𝑥⦌𝑅)
13		csbeq1a 3879	. . . . . . . 8 ⊢ (𝑦 = 𝑣 → ⦋𝑢 / 𝑥⦌𝑅 = ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
14	12, 13	sylan9eq 2785	. . . . . . 7 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → 𝑅 = ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
15	6, 7, 10, 11, 14	cbvmpo 7486	. . . . . 6 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
16		vex 3454	. . . . . . . . 9 ⊢ 𝑢 ∈ V
17		vex 3454	. . . . . . . . 9 ⊢ 𝑣 ∈ V
18	16, 17	op2ndd 7982	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → (2nd ‘𝑤) = 𝑣)
19	16, 17	op1std 7981	. . . . . . . . 9 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → (1st ‘𝑤) = 𝑢)
20	19	csbeq1d 3869	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → ⦋(1st ‘𝑤) / 𝑥⦌𝑅 = ⦋𝑢 / 𝑥⦌𝑅)
21	18, 20	csbeq12dv 3874	. . . . . . 7 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 = ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
22	21	mpompt 7506	. . . . . 6 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
23	15, 22	eqtr4i 2756	. . . . 5 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅) = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅)
24	23	fmpt 7085	. . . 4 ⊢ (∀𝑤 ∈ (𝐴 × 𝐵)⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 ∈ 𝐶 ↔ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅):(𝐴 × 𝐵)⟶𝐶)
25	5, 24	sylibr 234	. . 3 ⊢ (𝜑 → ∀𝑤 ∈ (𝐴 × 𝐵)⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 ∈ 𝐶)
26		fmpocos.2	. . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅))
27	26, 23	eqtrdi 2781	. . 3 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅))
28		fmpocos.3	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ 𝐶 ↦ 𝑆))
29	25, 27, 28	fmptcos 7106	. 2 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆))
30	21	csbeq1d 3869	. . . . 5 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆 = ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
31	30	mpompt 7506	. . . 4 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
32		nfcv 2892	. . . . 5 ⊢ Ⅎ𝑢⦋𝑅 / 𝑧⦌𝑆
33		nfcv 2892	. . . . 5 ⊢ Ⅎ𝑣⦋𝑅 / 𝑧⦌𝑆
34		nfcv 2892	. . . . . 6 ⊢ Ⅎ𝑥𝑆
35	10, 34	nfcsbw 3891	. . . . 5 ⊢ Ⅎ𝑥⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆
36		nfcv 2892	. . . . . 6 ⊢ Ⅎ𝑦𝑆
37	11, 36	nfcsbw 3891	. . . . 5 ⊢ Ⅎ𝑦⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆
38	14	csbeq1d 3869	. . . . 5 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → ⦋𝑅 / 𝑧⦌𝑆 = ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
39	32, 33, 35, 37, 38	cbvmpo 7486	. . . 4 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⦋𝑅 / 𝑧⦌𝑆) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
40	31, 39	eqtr4i 2756	. . 3 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⦋𝑅 / 𝑧⦌𝑆)
41		fmpocos.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ⦋𝑅 / 𝑧⦌𝑆 = 𝑇)
42	41	3impb 1114	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⦋𝑅 / 𝑧⦌𝑆 = 𝑇)
43	42	mpoeq3dva 7469	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⦋𝑅 / 𝑧⦌𝑆) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑇))
44	40, 43	eqtrid 2777	. 2 ⊢ (𝜑 → (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑇))
45	29, 44	eqtrd 2765	1 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑇))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3045  ⦋csb 3865  ⟨cop 4598   ↦ cmpt 5191   × cxp 5639   ∘ ccom 5645  ⟶wf 6510  ‘cfv 6514   ∈ cmpo 7392  1^st c1st 7969  2^nd c2nd 7970

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fv 6522  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972

This theorem is referenced by:  evlselv  42582