Theorem offsplitfpar 7931

Description: Express the function operation map ∘_f by the functions defined in fsplit 7928 and fpar 7927. (Contributed by AV, 4-Jan-2024.)

Hypotheses

Ref	Expression
fsplitfpar.h	⊢ 𝐻 = ((◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝐺 ∘ (2nd ↾ (V × V)))))
fsplitfpar.s	⊢ 𝑆 = (◡(1st ↾ I ) ↾ 𝐴)

Assertion

Ref	Expression
offsplitfpar	⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → ( + ∘ (𝐻 ∘ 𝑆)) = (𝐹 ∘f + 𝐺))

Proof of Theorem offsplitfpar

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fsplitfpar.h	. . . . 5 ⊢ 𝐻 = ((◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝐺 ∘ (2nd ↾ (V × V)))))
2		fsplitfpar.s	. . . . 5 ⊢ 𝑆 = (◡(1st ↾ I ) ↾ 𝐴)
3	1, 2	fsplitfpar 7930	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐻 ∘ 𝑆) = (𝑎 ∈ 𝐴 ↦ ⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩))
4	3	coeq2d 5760	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → ( + ∘ (𝐻 ∘ 𝑆)) = ( + ∘ (𝑎 ∈ 𝐴 ↦ ⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩)))
5	4	3ad2ant1 1131	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → ( + ∘ (𝐻 ∘ 𝑆)) = ( + ∘ (𝑎 ∈ 𝐴 ↦ ⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩)))
6		dffn3 6597	. . . . . . 7 ⊢ ( + Fn 𝐶 ↔ + :𝐶⟶ran + )
7	6	biimpi 215	. . . . . 6 ⊢ ( + Fn 𝐶 → + :𝐶⟶ran + )
8	7	adantr 480	. . . . 5 ⊢ (( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶) → + :𝐶⟶ran + )
9	8	3ad2ant3 1133	. . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → + :𝐶⟶ran + )
10		simpl3r 1227	. . . . 5 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) ∧ 𝑎 ∈ 𝐴) → (ran 𝐹 × ran 𝐺) ⊆ 𝐶)
11		simp1l 1195	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → 𝐹 Fn 𝐴)
12		fnfvelrn 6940	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ ran 𝐹)
13	11, 12	sylan 579	. . . . . 6 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ ran 𝐹)
14		simp1r 1196	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → 𝐺 Fn 𝐴)
15		fnfvelrn 6940	. . . . . . 7 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) ∈ ran 𝐺)
16	14, 15	sylan 579	. . . . . 6 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) ∈ ran 𝐺)
17	13, 16	opelxpd 5618	. . . . 5 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) ∧ 𝑎 ∈ 𝐴) → ⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩ ∈ (ran 𝐹 × ran 𝐺))
18	10, 17	sseldd 3918	. . . 4 ⊢ ((((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) ∧ 𝑎 ∈ 𝐴) → ⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩ ∈ 𝐶)
19	9, 18	cofmpt 6986	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → ( + ∘ (𝑎 ∈ 𝐴 ↦ ⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩)) = (𝑎 ∈ 𝐴 ↦ ( + ‘⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩)))
20		df-ov 7258	. . . . 5 ⊢ ((𝐹‘𝑎) + (𝐺‘𝑎)) = ( + ‘⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩)
21	20	eqcomi 2747	. . . 4 ⊢ ( + ‘⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩) = ((𝐹‘𝑎) + (𝐺‘𝑎))
22	21	mpteq2i 5175	. . 3 ⊢ (𝑎 ∈ 𝐴 ↦ ( + ‘⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩)) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎)))
23	19, 22	eqtrdi 2795	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → ( + ∘ (𝑎 ∈ 𝐴 ↦ ⟨(𝐹‘𝑎), (𝐺‘𝑎)⟩)) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
24		offval3 7798	. . . . 5 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝐹 ∘f + 𝐺) = (𝑎 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
25		fndm 6520	. . . . . . . 8 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
26		fndm 6520	. . . . . . . 8 ⊢ (𝐺 Fn 𝐴 → dom 𝐺 = 𝐴)
27	25, 26	ineqan12d 4145	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (dom 𝐹 ∩ dom 𝐺) = (𝐴 ∩ 𝐴))
28		inidm 4149	. . . . . . 7 ⊢ (𝐴 ∩ 𝐴) = 𝐴
29	27, 28	eqtrdi 2795	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (dom 𝐹 ∩ dom 𝐺) = 𝐴)
30	29	mpteq1d 5165	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝑎 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
31	24, 30	sylan9eqr 2801	. . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → (𝐹 ∘f + 𝐺) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
32	31	eqcomd 2744	. . 3 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊)) → (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = (𝐹 ∘f + 𝐺))
33	32	3adant3 1130	. 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = (𝐹 ∘f + 𝐺))
34	5, 23, 33	3eqtrd 2782	1 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) ∧ ( + Fn 𝐶 ∧ (ran 𝐹 × ran 𝐺) ⊆ 𝐶)) → ( + ∘ (𝐻 ∘ 𝑆)) = (𝐹 ∘f + 𝐺))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883  ⟨cop 4564   ↦ cmpt 5153   I cid 5479   × cxp 5578  ^◡ccnv 5579  dom cdm 5580  ran crn 5581   ↾ cres 5582   ∘ ccom 5584   Fn wfn 6413  ⟶wf 6414  ‘cfv 6418  (class class class)co 7255   ∘_f cof 7509  1^st c1st 7802  2^nd c2nd 7803

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-of 7511  df-1st 7804  df-2nd 7805

This theorem is referenced by: (None)