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

Theorem mpoxopoveqd 8168
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 8166 . . . 4 (((𝑉𝑋𝑊𝑌) ∧ 𝐾𝑉) → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
32ex 413 . . 3 ((𝑉𝑋𝑊𝑌) → (𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
4 mpoxopoveqd.1 . . 3 (𝜓 → (𝑉𝑋𝑊𝑌))
53, 4syl11 33 . 2 (𝐾𝑉 → (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
6 df-nel 3040 . . . . . 6 (𝐾𝑉 ↔ ¬ 𝐾𝑉)
71mpoxopynvov0 8165 . . . . . 6 (𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
86, 7sylbir 236 . . . . 5 𝐾𝑉 → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
98adantr 481 . . . 4 ((¬ 𝐾𝑉𝜓) → (⟨𝑉, 𝑊𝐹𝐾) = ∅)
10 mpoxopoveqd.2 . . . . . 6 ((𝜓 ∧ ¬ 𝐾𝑉) → {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} = ∅)
1110eqcomd 2746 . . . . 5 ((𝜓 ∧ ¬ 𝐾𝑉) → ∅ = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
1211ancoms 459 . . . 4 ((¬ 𝐾𝑉𝜓) → ∅ = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
139, 12eqtrd 2775 . . 3 ((¬ 𝐾𝑉𝜓) → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
1413ex 413 . 2 𝐾𝑉 → (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
155, 14pm2.61i 183 1 (𝜓 → (⟨𝑉, 𝑊𝐹𝐾) = {𝑛𝑉[𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396   = wceq 1547  wcel 2119  wnel 3039  {crab 3392  Vcvv 3432  [wsbc 3730  c0 4268  cop 4568  cfv 6492  (class class class)co 7363  cmpo 7365  1st c1st 7936
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator