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

Theorem mpoxopoveqd 7884
Description: Value of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument, deduction version. (Contributed by Alexander van der Vekens, 11-Oct-2017.)
Hypotheses
Ref Expression
mpoxopoveq.f 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st𝑥) ↦ {𝑛 ∈ (1st𝑥) ∣ 𝜑})
mpoxopoveqd.1 (𝜓 → (𝑉𝑋𝑊𝑌))
mpoxopoveqd.2 ((𝜓 ∧ ¬ 𝐾𝑉) → {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} = ∅)
Assertion
Ref Expression
mpoxopoveqd (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
Distinct variable groups:   𝑛,𝐾,𝑥,𝑦   𝑛,𝑉,𝑥,𝑦   𝑛,𝑊,𝑥,𝑦   𝑛,𝑋,𝑥,𝑦   𝑛,𝑌,𝑥,𝑦   𝑥,𝐹
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑛)   𝜓(𝑥,𝑦,𝑛)   𝐹(𝑦,𝑛)

Proof of Theorem mpoxopoveqd
StepHypRef Expression
1 mpoxopoveq.f . . . . 5 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st𝑥) ↦ {𝑛 ∈ (1st𝑥) ∣ 𝜑})
21mpoxopoveq 7882 . . . 4 (((𝑉𝑋𝑊𝑌) ∧ 𝐾𝑉) → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
32ex 415 . . 3 ((𝑉𝑋𝑊𝑌) → (𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
4 mpoxopoveqd.1 . . 3 (𝜓 → (𝑉𝑋𝑊𝑌))
53, 4syl11 33 . 2 (𝐾𝑉 → (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
6 df-nel 3123 . . . . . 6 (𝐾𝑉 ↔ ¬ 𝐾𝑉)
71mpoxopynvov0 7881 . . . . . 6 (𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
86, 7sylbir 237 . . . . 5 𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
98adantr 483 . . . 4 ((¬ 𝐾𝑉𝜓) → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
10 mpoxopoveqd.2 . . . . . 6 ((𝜓 ∧ ¬ 𝐾𝑉) → {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} = ∅)
1110eqcomd 2826 . . . . 5 ((𝜓 ∧ ¬ 𝐾𝑉) → ∅ = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
1211ancoms 461 . . . 4 ((¬ 𝐾𝑉𝜓) → ∅ = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
139, 12eqtrd 2855 . . 3 ((¬ 𝐾𝑉𝜓) → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
1413ex 415 . 2 𝐾𝑉 → (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
155, 14pm2.61i 184 1 (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1536  wcel 2113  wnel 3122  {crab 3141  Vcvv 3493  [wsbc 3770  c0 4288  cop 4570  cfv 6352  (class class class)co 7153  cmpo 7155  1st c1st 7684
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5327  ax-un 7458
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-nel 3123  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3495  df-sbc 3771  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4465  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4836  df-iun 4918  df-br 5064  df-opab 5126  df-mpt 5144  df-id 5457  df-xp 5558  df-rel 5559  df-cnv 5560  df-co 5561  df-dm 5562  df-rn 5563  df-res 5564  df-ima 5565  df-iota 6311  df-fun 6354  df-fv 6360  df-ov 7156  df-oprab 7157  df-mpo 7158  df-1st 7686  df-2nd 7687
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator