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

Theorem mpt3fvd 7689
Description: Value of a three-argument function in maps-to notation. (Contributed by BTernaryTau, 28-Sep-2026.)
Hypotheses
Ref Expression
mpt3fvd.1 (𝜑 → 𝑋 ∈ ((𝐴 × 𝐵) × 𝐶))
mpt3fvd.2 (𝜑 → 𝑌 ∈ 𝑉)
mpt3fvd.3 ((𝜑 ∧ 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩) → 𝑌 = 𝐷)
mpt3fvd.4 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵, 𝑧 ∈ 𝐶 ↦ 𝐷)
Assertion
Ref Expression
mpt3fvd (𝜑 → (𝐹‘𝑋) = 𝑌)
Distinct variable groups:   𝜑,𝑥,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧   𝑥,𝑌,𝑦,𝑧
Allowed substitution hints:   𝐷(𝑥, 𝑦, 𝑧)   𝐹(𝑥, 𝑦, 𝑧)   𝑉(𝑥, 𝑦, 𝑧)

Proof of Theorem mpt3fvd
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mpt3fvd.1 . . . 4 (𝜑 → 𝑋 ∈ ((𝐴 × 𝐵) × 𝐶))
2 el2xptp 5819 . . . 4 (𝑋 ∈ ((𝐴 × 𝐵) × 𝐶) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩)
31, 2sylib 221 . . 3 (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩)
4 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩) → 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩)
5 mpt3fvd.3 . . . . . . . 8 ((𝜑 ∧ 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩) → 𝑌 = 𝐷)
64, 5jca 521 . . . . . . 7 ((𝜑 ∧ 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩) → (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷))
76ex 418 . . . . . 6 (𝜑 → (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ → (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷)))
87reximdv 3177 . . . . 5 (𝜑 → (∃𝑧 ∈ 𝐶 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷)))
98reximdv 3177 . . . 4 (𝜑 → (∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷)))
109reximdv 3177 . . 3 (𝜑 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷)))
113, 10mpd 16 . 2 (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷))
121elexd 3473 . . 3 (𝜑 → 𝑋 ∈ V)
13 mpt3fvd.2 . . 3 (𝜑 → 𝑌 ∈ 𝑉)
14 eqeq1 2764 . . . . . . . 8 (𝑣 = 𝑋 → (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ↔ 𝑋 = ⟨𝑥, 𝑦, 𝑧⟩))
1514anbi1d 643 . . . . . . 7 (𝑣 = 𝑋 → ((𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)))
1615rexbidv 3186 . . . . . 6 (𝑣 = 𝑋 → (∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)))
17162rexbidv 3227 . . . . 5 (𝑣 = 𝑋 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)))
18 eqeq1 2764 . . . . . . . 8 (𝑤 = 𝑌 → (𝑤 = 𝐷 ↔ 𝑌 = 𝐷))
1918anbi2d 642 . . . . . . 7 (𝑤 = 𝑌 → ((𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷)))
2019rexbidv 3186 . . . . . 6 (𝑤 = 𝑌 → (∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷)))
21202rexbidv 3227 . . . . 5 (𝑤 = 𝑌 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷)))
22 moeq 3664 . . . . . . . . . . 11 ∃*𝑤 𝑤 = 𝐷
2322moani 2578 . . . . . . . . . 10 ∃*𝑤((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)
2423ax-gen 1827 . . . . . . . . 9 ∀𝑧∃*𝑤((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)
2524gen2 1828 . . . . . . . 8 ∀𝑥∀𝑦∀𝑧∃*𝑤((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)
26 mosubott 5483 . . . . . . . 8 (∀𝑥∀𝑦∀𝑧∃*𝑤((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷) → ∃*𝑤∃𝑥∃𝑦∃𝑧(𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)))
2725, 26ax-mp 5 . . . . . . 7 ∃*𝑤∃𝑥∃𝑦∃𝑧(𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷))
28 r3ex 3201 . . . . . . . . 9 (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ ∃𝑥∃𝑦∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)))
29 an12 658 . . . . . . . . . 10 ((𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)))
30293exbii 1882 . . . . . . . . 9 (∃𝑥∃𝑦∃𝑧(𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)) ↔ ∃𝑥∃𝑦∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)))
3128, 30bitr4i 281 . . . . . . . 8 (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ ∃𝑥∃𝑦∃𝑧(𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)))
3231mobii 2573 . . . . . . 7 (∃*𝑤∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ ∃*𝑤∃𝑥∃𝑦∃𝑧(𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ 𝑤 = 𝐷)))
3327, 32mpbir 234 . . . . . 6 ∃*𝑤∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)
3433a1i 11 . . . . 5 (𝑣 ∈ V → ∃*𝑤∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷))
35 df-mpt3 7685 . . . . . 6 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵, 𝑧 ∈ 𝐶 ↦ 𝐷) = {⟨𝑣, 𝑤⟩ ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)}
36 vex 3454 . . . . . . . 8 𝑣 ∈ V
3736biantrur 540 . . . . . . 7 (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷) ↔ (𝑣 ∈ V ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)))
3837opabbii 5171 . . . . . 6 {⟨𝑣, 𝑤⟩ ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷)} = {⟨𝑣, 𝑤⟩ ∣ (𝑣 ∈ V ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷))}
3935, 38eqtri 2783 . . . . 5 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵, 𝑧 ∈ 𝐶 ↦ 𝐷) = {⟨𝑣, 𝑤⟩ ∣ (𝑣 ∈ V ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑣 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑤 = 𝐷))}
4017, 21, 34, 39fvopab3ig 6990 . . . 4 ((𝑋 ∈ V ∧ 𝑌 ∈ 𝑉) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷) → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵, 𝑧 ∈ 𝐶 ↦ 𝐷)‘𝑋) = 𝑌))
41 mpt3fvd.4 . . . . . 6 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵, 𝑧 ∈ 𝐶 ↦ 𝐷)
4241fveq1i 6887 . . . . 5 (𝐹‘𝑋) = ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵, 𝑧 ∈ 𝐶 ↦ 𝐷)‘𝑋)
4342eqeq1i 2765 . . . 4 ((𝐹‘𝑋) = 𝑌 ↔ ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵, 𝑧 ∈ 𝐶 ↦ 𝐷)‘𝑋) = 𝑌)
4440, 43imbitrrdi 255 . . 3 ((𝑋 ∈ V ∧ 𝑌 ∈ 𝑉) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷) → (𝐹‘𝑋) = 𝑌))
4512, 13, 44syl2anc 596 . 2 (𝜑 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐶 (𝑋 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ 𝑌 = 𝐷) → (𝐹‘𝑋) = 𝑌))
4611, 45mpd 16 1 (𝜑 → (𝐹‘𝑋) = 𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃*wmo 2562  ∃wrex 3086  Vcvv 3450  ⟨cotp 4857  {copab 5166   × cxp 5648  ‘cfv 6539   ∈ cmpt3 7684
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-ot 4858  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-mpt3 7685
This theorem is used by:  mpt3fvotd  7690
  Copyright terms: Public domain W3C validator