Theorem fpar 8048

Description: Merge two functions in parallel. Use as the second argument of a composition with a binary operation to build compound functions such as (𝑥 ∈ (0[,)+∞), 𝑦 ∈ ℝ ↦ ((√‘𝑥) + (sin‘𝑦))), see also ex-fpar 29406. (Contributed by NM, 17-Sep-2007.) (Proof shortened by Mario Carneiro, 28-Apr-2015.)

Hypothesis

Ref	Expression
fpar.1	⊢ 𝐻 = ((◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝐺 ∘ (2nd ↾ (V × V)))))

Assertion

Ref	Expression
fpar	⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → 𝐻 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦

Allowed substitution hints:   𝐻(𝑥,𝑦)

Proof of Theorem fpar

Step	Hyp	Ref	Expression
1		fparlem3 8046	. . 3 ⊢ (𝐹 Fn 𝐴 → (◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) = ∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)))
2		fparlem4 8047	. . 3 ⊢ (𝐺 Fn 𝐵 → (◡(2nd ↾ (V × V)) ∘ (𝐺 ∘ (2nd ↾ (V × V)))) = ∪ 𝑦 ∈ 𝐵 ((V × {𝑦}) × (V × {(𝐺‘𝑦)})))
3	1, 2	ineqan12d 4174	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → ((◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝐺 ∘ (2nd ↾ (V × V))))) = (∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ∪ 𝑦 ∈ 𝐵 ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))))
4		fpar.1	. 2 ⊢ 𝐻 = ((◡(1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝐺 ∘ (2nd ↾ (V × V)))))
5		opex 5421	. . . 4 ⊢ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩ ∈ V
6	5	dfmpo 8034	. . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩) = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩⟩}
7		inxp 5788	. . . . . . . 8 ⊢ ((({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))) = ((({𝑥} × V) ∩ (V × {𝑦})) × (({(𝐹‘𝑥)} × V) ∩ (V × {(𝐺‘𝑦)})))
8		inxp 5788	. . . . . . . . . 10 ⊢ (({𝑥} × V) ∩ (V × {𝑦})) = (({𝑥} ∩ V) × (V ∩ {𝑦}))
9		inv1 4354	. . . . . . . . . . 11 ⊢ ({𝑥} ∩ V) = {𝑥}
10		incom 4161	. . . . . . . . . . . 12 ⊢ (V ∩ {𝑦}) = ({𝑦} ∩ V)
11		inv1 4354	. . . . . . . . . . . 12 ⊢ ({𝑦} ∩ V) = {𝑦}
12	10, 11	eqtri 2764	. . . . . . . . . . 11 ⊢ (V ∩ {𝑦}) = {𝑦}
13	9, 12	xpeq12i 5661	. . . . . . . . . 10 ⊢ (({𝑥} ∩ V) × (V ∩ {𝑦})) = ({𝑥} × {𝑦})
14		vex 3449	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
15		vex 3449	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
16	14, 15	xpsn 7087	. . . . . . . . . 10 ⊢ ({𝑥} × {𝑦}) = {⟨𝑥, 𝑦⟩}
17	8, 13, 16	3eqtri 2768	. . . . . . . . 9 ⊢ (({𝑥} × V) ∩ (V × {𝑦})) = {⟨𝑥, 𝑦⟩}
18		inxp 5788	. . . . . . . . . 10 ⊢ (({(𝐹‘𝑥)} × V) ∩ (V × {(𝐺‘𝑦)})) = (({(𝐹‘𝑥)} ∩ V) × (V ∩ {(𝐺‘𝑦)}))
19		inv1 4354	. . . . . . . . . . 11 ⊢ ({(𝐹‘𝑥)} ∩ V) = {(𝐹‘𝑥)}
20		incom 4161	. . . . . . . . . . . 12 ⊢ (V ∩ {(𝐺‘𝑦)}) = ({(𝐺‘𝑦)} ∩ V)
21		inv1 4354	. . . . . . . . . . . 12 ⊢ ({(𝐺‘𝑦)} ∩ V) = {(𝐺‘𝑦)}
22	20, 21	eqtri 2764	. . . . . . . . . . 11 ⊢ (V ∩ {(𝐺‘𝑦)}) = {(𝐺‘𝑦)}
23	19, 22	xpeq12i 5661	. . . . . . . . . 10 ⊢ (({(𝐹‘𝑥)} ∩ V) × (V ∩ {(𝐺‘𝑦)})) = ({(𝐹‘𝑥)} × {(𝐺‘𝑦)})
24		fvex 6855	. . . . . . . . . . 11 ⊢ (𝐹‘𝑥) ∈ V
25		fvex 6855	. . . . . . . . . . 11 ⊢ (𝐺‘𝑦) ∈ V
26	24, 25	xpsn 7087	. . . . . . . . . 10 ⊢ ({(𝐹‘𝑥)} × {(𝐺‘𝑦)}) = {⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩}
27	18, 23, 26	3eqtri 2768	. . . . . . . . 9 ⊢ (({(𝐹‘𝑥)} × V) ∩ (V × {(𝐺‘𝑦)})) = {⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩}
28	17, 27	xpeq12i 5661	. . . . . . . 8 ⊢ ((({𝑥} × V) ∩ (V × {𝑦})) × (({(𝐹‘𝑥)} × V) ∩ (V × {(𝐺‘𝑦)}))) = ({⟨𝑥, 𝑦⟩} × {⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩})
29		opex 5421	. . . . . . . . 9 ⊢ ⟨𝑥, 𝑦⟩ ∈ V
30	29, 5	xpsn 7087	. . . . . . . 8 ⊢ ({⟨𝑥, 𝑦⟩} × {⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩}) = {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩⟩}
31	7, 28, 30	3eqtri 2768	. . . . . . 7 ⊢ ((({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))) = {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩⟩}
32	31	a1i 11	. . . . . 6 ⊢ (𝑦 ∈ 𝐵 → ((({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))) = {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩⟩})
33	32	iuneq2i 4975	. . . . 5 ⊢ ∪ 𝑦 ∈ 𝐵 ((({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))) = ∪ 𝑦 ∈ 𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩⟩}
34	33	a1i 11	. . . 4 ⊢ (𝑥 ∈ 𝐴 → ∪ 𝑦 ∈ 𝐵 ((({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))) = ∪ 𝑦 ∈ 𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩⟩})
35	34	iuneq2i 4975	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 ((({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))) = ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩⟩}
36		2iunin 5036	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 ∪ 𝑦 ∈ 𝐵 ((({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺‘𝑦)}))) = (∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ∪ 𝑦 ∈ 𝐵 ((V × {𝑦}) × (V × {(𝐺‘𝑦)})))
37	6, 35, 36	3eqtr2i 2770	. 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩) = (∪ 𝑥 ∈ 𝐴 (({𝑥} × V) × ({(𝐹‘𝑥)} × V)) ∩ ∪ 𝑦 ∈ 𝐵 ((V × {𝑦}) × (V × {(𝐺‘𝑦)})))
38	3, 4, 37	3eqtr4g 2801	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → 𝐻 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  Vcvv 3445   ∩ cin 3909  {csn 4586  ⟨cop 4592  ∪ ciun 4954   × cxp 5631  ^◡ccnv 5632   ↾ cres 5635   ∘ ccom 5637   Fn wfn 6491  ‘cfv 6496   ∈ cmpo 7359  1^st c1st 7919  2^nd c2nd 7920

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922

This theorem is referenced by:  fsplitfpar  8050  ex-fpar  29406