Theorem fmpocos 41756

Description: Composition of two functions. Variation of fmpoco 8106 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 3198	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑅 ∈ 𝐶)
3		eqid 2728	. . . . . 6 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅)
4	3	fmpo 8078	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑅 ∈ 𝐶 ↔ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅):(𝐴 × 𝐵)⟶𝐶)
5	2, 4	sylib 217	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅):(𝐴 × 𝐵)⟶𝐶)
6		nfcv 2899	. . . . . . 7 ⊢ Ⅎ𝑢𝑅
7		nfcv 2899	. . . . . . 7 ⊢ Ⅎ𝑣𝑅
8		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑥𝑣
9		nfcsb1v 3919	. . . . . . . 8 ⊢ Ⅎ𝑥⦋𝑢 / 𝑥⦌𝑅
10	8, 9	nfcsbw 3921	. . . . . . 7 ⊢ Ⅎ𝑥⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅
11		nfcsb1v 3919	. . . . . . 7 ⊢ Ⅎ𝑦⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅
12		csbeq1a 3908	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → 𝑅 = ⦋𝑢 / 𝑥⦌𝑅)
13		csbeq1a 3908	. . . . . . . 8 ⊢ (𝑦 = 𝑣 → ⦋𝑢 / 𝑥⦌𝑅 = ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
14	12, 13	sylan9eq 2788	. . . . . . 7 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → 𝑅 = ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
15	6, 7, 10, 11, 14	cbvmpo 7520	. . . . . 6 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
16		vex 3477	. . . . . . . . 9 ⊢ 𝑢 ∈ V
17		vex 3477	. . . . . . . . 9 ⊢ 𝑣 ∈ V
18	16, 17	op2ndd 8010	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → (2nd ‘𝑤) = 𝑣)
19	16, 17	op1std 8009	. . . . . . . . 9 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → (1st ‘𝑤) = 𝑢)
20	19	csbeq1d 3898	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → ⦋(1st ‘𝑤) / 𝑥⦌𝑅 = ⦋𝑢 / 𝑥⦌𝑅)
21	18, 20	csbeq12dv 3903	. . . . . . 7 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 = ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
22	21	mpompt 7540	. . . . . 6 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅)
23	15, 22	eqtr4i 2759	. . . . 5 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅) = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅)
24	23	fmpt 7125	. . . 4 ⊢ (∀𝑤 ∈ (𝐴 × 𝐵)⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 ∈ 𝐶 ↔ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅):(𝐴 × 𝐵)⟶𝐶)
25	5, 24	sylibr 233	. . 3 ⊢ (𝜑 → ∀𝑤 ∈ (𝐴 × 𝐵)⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 ∈ 𝐶)
26		fmpocos.2	. . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑅))
27	26, 23	eqtrdi 2784	. . 3 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅))
28		fmpocos.3	. . 3 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ 𝐶 ↦ 𝑆))
29	25, 27, 28	fmptcos 7146	. 2 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆))
30	21	csbeq1d 3898	. . . . 5 ⊢ (𝑤 = ⟨𝑢, 𝑣⟩ → ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆 = ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
31	30	mpompt 7540	. . . 4 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
32		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑢⦋𝑅 / 𝑧⦌𝑆
33		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑣⦋𝑅 / 𝑧⦌𝑆
34		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑥𝑆
35	10, 34	nfcsbw 3921	. . . . 5 ⊢ Ⅎ𝑥⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆
36		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑦𝑆
37	11, 36	nfcsbw 3921	. . . . 5 ⊢ Ⅎ𝑦⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆
38	14	csbeq1d 3898	. . . . 5 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → ⦋𝑅 / 𝑧⦌𝑆 = ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
39	32, 33, 35, 37, 38	cbvmpo 7520	. . . 4 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⦋𝑅 / 𝑧⦌𝑆) = (𝑢 ∈ 𝐴, 𝑣 ∈ 𝐵 ↦ ⦋⦋𝑣 / 𝑦⦌⦋𝑢 / 𝑥⦌𝑅 / 𝑧⦌𝑆)
40	31, 39	eqtr4i 2759	. . 3 ⊢ (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⦋𝑅 / 𝑧⦌𝑆)
41		fmpocos.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ⦋𝑅 / 𝑧⦌𝑆 = 𝑇)
42	41	3impb 1112	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⦋𝑅 / 𝑧⦌𝑆 = 𝑇)
43	42	mpoeq3dva 7503	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⦋𝑅 / 𝑧⦌𝑆) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑇))
44	40, 43	eqtrid 2780	. 2 ⊢ (𝜑 → (𝑤 ∈ (𝐴 × 𝐵) ↦ ⦋⦋(2nd ‘𝑤) / 𝑦⦌⦋(1st ‘𝑤) / 𝑥⦌𝑅 / 𝑧⦌𝑆) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑇))
45	29, 44	eqtrd 2768	1 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝑇))

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1533   ∈ wcel 2098  ∀wral 3058  ⦋csb 3894  ⟨cop 4638   ↦ cmpt 5235   × cxp 5680   ∘ ccom 5686  ⟶wf 6549  ‘cfv 6553   ∈ cmpo 7428  1^st c1st 7997  2^nd c2nd 7998

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pr 5433  ax-un 7746

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-iun 5002  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-fv 6561  df-oprab 7430  df-mpo 7431  df-1st 7999  df-2nd 8000

This theorem is referenced by:  evlselv  41851