Metamath Proof Explorer


Theorem offsplitfpar

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

Ref Expression
Hypotheses fsplitfpar.h ⊢ H = 1 st ↾ V × V -1 ∘ F ∘ 1 st ↾ V × V ∩ 2 nd ↾ V × V -1 ∘ G ∘ 2 nd ↾ V × V
fsplitfpar.s ⊢ S = 1 st ↾ I -1 ↾ A
Assertion offsplitfpar ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → + ˙ ∘ H ∘ S = F + ˙ f G

Proof

Step Hyp Ref Expression
1 fsplitfpar.h ⊢ H = 1 st ↾ V × V -1 ∘ F ∘ 1 st ↾ V × V ∩ 2 nd ↾ V × V -1 ∘ G ∘ 2 nd ↾ V × V
2 fsplitfpar.s ⊢ S = 1 st ↾ I -1 ↾ A
3 1 2 fsplitfpar ⊢ F Fn A ∧ G Fn A → H ∘ S = a ∈ A ⟼ F ⁡ a G ⁡ a
4 3 coeq2d ⊢ F Fn A ∧ G Fn A → + ˙ ∘ H ∘ S = + ˙ ∘ a ∈ A ⟼ F ⁡ a G ⁡ a
5 4 3ad2ant1 ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → + ˙ ∘ H ∘ S = + ˙ ∘ a ∈ A ⟼ F ⁡ a G ⁡ a
6 dffn3 ⊢ + ˙ Fn C ↔ + ˙ : C ⟶ ran ⁡ + ˙
7 6 birani ⊢ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → + ˙ : C ⟶ ran ⁡ + ˙
8 7 3ad2ant3 ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → + ˙ : C ⟶ ran ⁡ + ˙
9 simpl3r ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C ∧ a ∈ A → ran ⁡ F × ran ⁡ G ⊆ C
10 simp1l ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → F Fn A
11 fnfvelrn ⊢ F Fn A ∧ a ∈ A → F ⁡ a ∈ ran ⁡ F
12 10 11 sylan ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C ∧ a ∈ A → F ⁡ a ∈ ran ⁡ F
13 simp1r ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → G Fn A
14 fnfvelrn ⊢ G Fn A ∧ a ∈ A → G ⁡ a ∈ ran ⁡ G
15 13 14 sylan ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C ∧ a ∈ A → G ⁡ a ∈ ran ⁡ G
16 12 15 opelxpd ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C ∧ a ∈ A → F ⁡ a G ⁡ a ∈ ran ⁡ F × ran ⁡ G
17 9 16 sseldd ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C ∧ a ∈ A → F ⁡ a G ⁡ a ∈ C
18 8 17 cofmpt ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → + ˙ ∘ a ∈ A ⟼ F ⁡ a G ⁡ a = a ∈ A ⟼ + ˙ ⁡ F ⁡ a G ⁡ a
19 df-ov ⊢ F ⁡ a + ˙ G ⁡ a = + ˙ ⁡ F ⁡ a G ⁡ a
20 19 eqcomi ⊢ + ˙ ⁡ F ⁡ a G ⁡ a = F ⁡ a + ˙ G ⁡ a
21 20 mpteq2i ⊢ a ∈ A ⟼ + ˙ ⁡ F ⁡ a G ⁡ a = a ∈ A ⟼ F ⁡ a + ˙ G ⁡ a
22 18 21 eqtrdi ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → + ˙ ∘ a ∈ A ⟼ F ⁡ a G ⁡ a = a ∈ A ⟼ F ⁡ a + ˙ G ⁡ a
23 offval3 ⊢ F ∈ V ∧ G ∈ W → F + ˙ f G = a ∈ dom ⁡ F ∩ dom ⁡ G ⟼ F ⁡ a + ˙ G ⁡ a
24 fndm ⊢ F Fn A → dom ⁡ F = A
25 fndm ⊢ G Fn A → dom ⁡ G = A
26 24 25 ineqan12d ⊢ F Fn A ∧ G Fn A → dom ⁡ F ∩ dom ⁡ G = A ∩ A
27 inidm ⊢ A ∩ A = A
28 26 27 eqtrdi ⊢ F Fn A ∧ G Fn A → dom ⁡ F ∩ dom ⁡ G = A
29 28 mpteq1d ⊢ F Fn A ∧ G Fn A → a ∈ dom ⁡ F ∩ dom ⁡ G ⟼ F ⁡ a + ˙ G ⁡ a = a ∈ A ⟼ F ⁡ a + ˙ G ⁡ a
30 23 29 sylan9eqr ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W → F + ˙ f G = a ∈ A ⟼ F ⁡ a + ˙ G ⁡ a
31 30 eqcomd ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W → a ∈ A ⟼ F ⁡ a + ˙ G ⁡ a = F + ˙ f G
32 31 3adant3 ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → a ∈ A ⟼ F ⁡ a + ˙ G ⁡ a = F + ˙ f G
33 5 22 32 3eqtrd ⊢ F Fn A ∧ G Fn A ∧ F ∈ V ∧ G ∈ W ∧ + ˙ Fn C ∧ ran ⁡ F × ran ⁡ G ⊆ C → + ˙ ∘ H ∘ S = F + ˙ f G