Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  fpar Structured version   Visualization version   GIF version

Theorem fpar 7789
 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 28226. (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
StepHypRef Expression
1 fparlem3 7787 . . 3 (𝐹 Fn 𝐴 → ((1st ↾ (V × V)) ∘ (𝐹 ∘ (1st ↾ (V × V)))) = 𝑥𝐴 (({𝑥} × V) × ({(𝐹𝑥)} × V)))
2 fparlem4 7788 . . 3 (𝐺 Fn 𝐵 → ((2nd ↾ (V × V)) ∘ (𝐺 ∘ (2nd ↾ (V × V)))) = 𝑦𝐵 ((V × {𝑦}) × (V × {(𝐺𝑦)})))
31, 2ineqan12d 4169 . 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 5332 . . . 4 ⟨(𝐹𝑥), (𝐺𝑦)⟩ ∈ V
65dfmpo 7775 . . 3 (𝑥𝐴, 𝑦𝐵 ↦ ⟨(𝐹𝑥), (𝐺𝑦)⟩) = 𝑥𝐴 𝑦𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹𝑥), (𝐺𝑦)⟩⟩}
7 inxp 5679 . . . . . . . 8 ((({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺𝑦)}))) = ((({𝑥} × V) ∩ (V × {𝑦})) × (({(𝐹𝑥)} × V) ∩ (V × {(𝐺𝑦)})))
8 inxp 5679 . . . . . . . . . 10 (({𝑥} × V) ∩ (V × {𝑦})) = (({𝑥} ∩ V) × (V ∩ {𝑦}))
9 inv1 4324 . . . . . . . . . . 11 ({𝑥} ∩ V) = {𝑥}
10 incom 4156 . . . . . . . . . . . 12 (V ∩ {𝑦}) = ({𝑦} ∩ V)
11 inv1 4324 . . . . . . . . . . . 12 ({𝑦} ∩ V) = {𝑦}
1210, 11eqtri 2843 . . . . . . . . . . 11 (V ∩ {𝑦}) = {𝑦}
139, 12xpeq12i 5559 . . . . . . . . . 10 (({𝑥} ∩ V) × (V ∩ {𝑦})) = ({𝑥} × {𝑦})
14 vex 3476 . . . . . . . . . . 11 𝑥 ∈ V
15 vex 3476 . . . . . . . . . . 11 𝑦 ∈ V
1614, 15xpsn 6879 . . . . . . . . . 10 ({𝑥} × {𝑦}) = {⟨𝑥, 𝑦⟩}
178, 13, 163eqtri 2847 . . . . . . . . 9 (({𝑥} × V) ∩ (V × {𝑦})) = {⟨𝑥, 𝑦⟩}
18 inxp 5679 . . . . . . . . . 10 (({(𝐹𝑥)} × V) ∩ (V × {(𝐺𝑦)})) = (({(𝐹𝑥)} ∩ V) × (V ∩ {(𝐺𝑦)}))
19 inv1 4324 . . . . . . . . . . 11 ({(𝐹𝑥)} ∩ V) = {(𝐹𝑥)}
20 incom 4156 . . . . . . . . . . . 12 (V ∩ {(𝐺𝑦)}) = ({(𝐺𝑦)} ∩ V)
21 inv1 4324 . . . . . . . . . . . 12 ({(𝐺𝑦)} ∩ V) = {(𝐺𝑦)}
2220, 21eqtri 2843 . . . . . . . . . . 11 (V ∩ {(𝐺𝑦)}) = {(𝐺𝑦)}
2319, 22xpeq12i 5559 . . . . . . . . . 10 (({(𝐹𝑥)} ∩ V) × (V ∩ {(𝐺𝑦)})) = ({(𝐹𝑥)} × {(𝐺𝑦)})
24 fvex 6659 . . . . . . . . . . 11 (𝐹𝑥) ∈ V
25 fvex 6659 . . . . . . . . . . 11 (𝐺𝑦) ∈ V
2624, 25xpsn 6879 . . . . . . . . . 10 ({(𝐹𝑥)} × {(𝐺𝑦)}) = {⟨(𝐹𝑥), (𝐺𝑦)⟩}
2718, 23, 263eqtri 2847 . . . . . . . . 9 (({(𝐹𝑥)} × V) ∩ (V × {(𝐺𝑦)})) = {⟨(𝐹𝑥), (𝐺𝑦)⟩}
2817, 27xpeq12i 5559 . . . . . . . 8 ((({𝑥} × V) ∩ (V × {𝑦})) × (({(𝐹𝑥)} × V) ∩ (V × {(𝐺𝑦)}))) = ({⟨𝑥, 𝑦⟩} × {⟨(𝐹𝑥), (𝐺𝑦)⟩})
29 opex 5332 . . . . . . . . 9 𝑥, 𝑦⟩ ∈ V
3029, 5xpsn 6879 . . . . . . . 8 ({⟨𝑥, 𝑦⟩} × {⟨(𝐹𝑥), (𝐺𝑦)⟩}) = {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹𝑥), (𝐺𝑦)⟩⟩}
317, 28, 303eqtri 2847 . . . . . . 7 ((({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺𝑦)}))) = {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹𝑥), (𝐺𝑦)⟩⟩}
3231a1i 11 . . . . . 6 (𝑦𝐵 → ((({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺𝑦)}))) = {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹𝑥), (𝐺𝑦)⟩⟩})
3332iuneq2i 4916 . . . . 5 𝑦𝐵 ((({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺𝑦)}))) = 𝑦𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹𝑥), (𝐺𝑦)⟩⟩}
3433a1i 11 . . . 4 (𝑥𝐴 𝑦𝐵 ((({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺𝑦)}))) = 𝑦𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹𝑥), (𝐺𝑦)⟩⟩})
3534iuneq2i 4916 . . 3 𝑥𝐴 𝑦𝐵 ((({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺𝑦)}))) = 𝑥𝐴 𝑦𝐵 {⟨⟨𝑥, 𝑦⟩, ⟨(𝐹𝑥), (𝐺𝑦)⟩⟩}
36 2iunin 4974 . . 3 𝑥𝐴 𝑦𝐵 ((({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ ((V × {𝑦}) × (V × {(𝐺𝑦)}))) = ( 𝑥𝐴 (({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ 𝑦𝐵 ((V × {𝑦}) × (V × {(𝐺𝑦)})))
376, 35, 363eqtr2i 2849 . 2 (𝑥𝐴, 𝑦𝐵 ↦ ⟨(𝐹𝑥), (𝐺𝑦)⟩) = ( 𝑥𝐴 (({𝑥} × V) × ({(𝐹𝑥)} × V)) ∩ 𝑦𝐵 ((V × {𝑦}) × (V × {(𝐺𝑦)})))
383, 4, 373eqtr4g 2880 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → 𝐻 = (𝑥𝐴, 𝑦𝐵 ↦ ⟨(𝐹𝑥), (𝐺𝑦)⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114  Vcvv 3473   ∩ cin 3912  {csn 4543  ⟨cop 4549  ∪ ciun 4895   × cxp 5529  ◡ccnv 5530   ↾ cres 5533   ∘ ccom 5535   Fn wfn 6326  ‘cfv 6331   ∈ cmpo 7135  1st c1st 7665  2nd c2nd 7666 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-ral 3130  df-rex 3131  df-reu 3132  df-rab 3134  df-v 3475  df-sbc 3753  df-csb 3861  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4270  df-if 4444  df-sn 4544  df-pr 4546  df-op 4550  df-uni 4815  df-iun 4897  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5436  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-ima 5544  df-iota 6290  df-fun 6333  df-fn 6334  df-f 6335  df-f1 6336  df-fo 6337  df-f1o 6338  df-fv 6339  df-oprab 7137  df-mpo 7138  df-1st 7667  df-2nd 7668 This theorem is referenced by:  fsplitfpar  7792  ex-fpar  28226
 Copyright terms: Public domain W3C validator