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

Theorem mpoxopoveqd 8266
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 8264 . . . 4 (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
32ex 418 . . 3 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
4 mpoxopoveqd.1 . . 3 (𝜓 → (𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌))
53, 4syl11 34 . 2 (𝐾 ∈ 𝑉 → (𝜓 → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
6 df-nel 3066 . . . . . 6 (𝐾 ∉ 𝑉 ↔ ¬ 𝐾 ∈ 𝑉)
71mpoxopynvov0 8263 . . . . . 6 (𝐾 ∉ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
86, 7sylbir 238 . . . . 5 (¬ 𝐾 ∈ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
98adantr 486 . . . 4 ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
10 mpoxopoveqd.2 . . . . . 6 ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} = ∅)
1110eqcomd 2769 . . . . 5 ((𝜓 ∧ ¬ 𝐾 ∈ 𝑉) → ∅ = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
1211ancoms 464 . . . 4 ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → ∅ = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
139, 12eqtrd 2798 . . 3 ((¬ 𝐾 ∈ 𝑉 ∧ 𝜓) → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
1413ex 418 . 2 (¬ 𝐾 ∈ 𝑉 → (𝜓 → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
155, 14pm2.61i 184 1 (𝜓 → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ∉ wnel 3065  {crab 3416  Vcvv 3454  [wsbc 3742  ∅c0 4281  ⟨cop 4838  ‘cfv 6558  (class class class)co 7443   ∈ cmpo 7445  1st c1st 8023
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 5252  ax-nul 5263  ax-pr 5395  ax-un 7775
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-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator