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

Theorem mpoxopoveqd 8223
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 8221 . . . 4 (((𝑉𝑋𝑊𝑌) ∧ 𝐾𝑉) → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
32ex 418 . . 3 ((𝑉𝑋𝑊𝑌) → (𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
4 mpoxopoveqd.1 . . 3 (𝜓 → (𝑉𝑋𝑊𝑌))
53, 4syl11 34 . 2 (𝐾𝑉 → (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
6 df-nel 3064 . . . . . 6 (𝐾𝑉 ↔ ¬ 𝐾𝑉)
71mpoxopynvov0 8220 . . . . . 6 (𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
86, 7sylbir 238 . . . . 5 𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
98adantr 486 . . . 4 ((¬ 𝐾𝑉𝜓) → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
10 mpoxopoveqd.2 . . . . . 6 ((𝜓 ∧ ¬ 𝐾𝑉) → {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} = ∅)
1110eqcomd 2768 . . . . 5 ((𝜓 ∧ ¬ 𝐾𝑉) → ∅ = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
1211ancoms 464 . . . 4 ((¬ 𝐾𝑉𝜓) → ∅ = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
139, 12eqtrd 2797 . . 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 2145  wnel 3063  {crab 3414  Vcvv 3453  [wsbc 3742  c0 4282  cop 4593  cfv 6537  (class class class)co 7417  cmpo 7419  1st c1st 7988
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator