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

Theorem fvproj 8188
Description: Value of a function on ordered pairs with values expressed as ordered pairs. Note that 𝐹 and 𝐺 are the projections of 𝐻 to the first and second coordinate respectively. (Contributed by Thierry Arnoux, 30-Dec-2019.)
Hypotheses
Ref Expression
fvproj.h 𝐻 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩)
fvproj.x (𝜑 → 𝑋 ∈ 𝐴)
fvproj.y (𝜑 → 𝑌 ∈ 𝐵)
Assertion
Ref Expression
fvproj (𝜑 → (𝐻‘⟨𝑋, 𝑌⟩) = ⟨(𝐹‘𝑋), (𝐺‘𝑌)⟩)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐻(𝑥, 𝑦)   𝑋(𝑥, 𝑦)   𝑌(𝑥, 𝑦)

Proof of Theorem fvproj
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ov 7454 . 2 (𝑋𝐻𝑌) = (𝐻‘⟨𝑋, 𝑌⟩)
2 fvproj.x . . 3 (𝜑 → 𝑋 ∈ 𝐴)
3 fvproj.y . . 3 (𝜑 → 𝑌 ∈ 𝐵)
4 fveq2 6916 . . . . 5 (𝑎 = 𝑋 → (𝐹‘𝑎) = (𝐹‘𝑋))
54opeq1d 4851 . . . 4 (𝑎 = 𝑋 → ⟨(𝐹‘𝑎), (𝐺‘𝑏)⟩ = ⟨(𝐹‘𝑋), (𝐺‘𝑏)⟩)
6 fveq2 6916 . . . . 5 (𝑏 = 𝑌 → (𝐺‘𝑏) = (𝐺‘𝑌))
76opeq2d 4852 . . . 4 (𝑏 = 𝑌 → ⟨(𝐹‘𝑋), (𝐺‘𝑏)⟩ = ⟨(𝐹‘𝑋), (𝐺‘𝑌)⟩)
8 fvproj.h . . . . 5 𝐻 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩)
9 fveq2 6916 . . . . . . 7 (𝑥 = 𝑎 → (𝐹‘𝑥) = (𝐹‘𝑎))
109opeq1d 4851 . . . . . 6 (𝑥 = 𝑎 → ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩ = ⟨(𝐹‘𝑎), (𝐺‘𝑦)⟩)
11 fveq2 6916 . . . . . . 7 (𝑦 = 𝑏 → (𝐺‘𝑦) = (𝐺‘𝑏))
1211opeq2d 4852 . . . . . 6 (𝑦 = 𝑏 → ⟨(𝐹‘𝑎), (𝐺‘𝑦)⟩ = ⟨(𝐹‘𝑎), (𝐺‘𝑏)⟩)
1310, 12cbvmpov 7546 . . . . 5 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ ⟨(𝐹‘𝑥), (𝐺‘𝑦)⟩) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ ⟨(𝐹‘𝑎), (𝐺‘𝑏)⟩)
148, 13eqtri 2786 . . . 4 𝐻 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ ⟨(𝐹‘𝑎), (𝐺‘𝑏)⟩)
15 opex 5439 . . . 4 ⟨(𝐹‘𝑋), (𝐺‘𝑌)⟩ ∈ V
165, 7, 14, 15ovmpo 7612 . . 3 ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝑋𝐻𝑌) = ⟨(𝐹‘𝑋), (𝐺‘𝑌)⟩)
172, 3, 16syl2anc 596 . 2 (𝜑 → (𝑋𝐻𝑌) = ⟨(𝐹‘𝑋), (𝐺‘𝑌)⟩)
181, 17eqtr3id 2812 1 (𝜑 → (𝐻‘⟨𝑋, 𝑌⟩) = ⟨(𝐹‘𝑋), (𝐺‘𝑌)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ⟨cop 4840  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456
This theorem is used by:  fimaproj  8189  ex-fpar  31120  qtophaus  34579
  Copyright terms: Public domain W3C validator