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

Theorem mpoxopynvov0 8263
Description: If the second argument 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 is not element of the first component of the first argument, then the value of the operation is the empty set. (Contributed by Alexander van der Vekens, 10-Oct-2017.)
Hypothesis
Ref Expression
mpoxopn0yelv.f 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶)
Assertion
Ref Expression
mpoxopynvov0 (𝐾 ∉ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
Distinct variable groups:   𝑥,𝑦   𝑥,𝐾   𝑥,𝑉   𝑥,𝑊   𝑥,𝐹
Allowed substitution hints:   𝐶(𝑥, 𝑦)   𝐹(𝑦)   𝐾(𝑦)   𝑉(𝑦)   𝑊(𝑦)

Proof of Theorem mpoxopynvov0
StepHypRef Expression
1 mpoxopn0yelv.f . . . 4 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶)
21mpoxopynvov0g 8259 . . 3 (((𝑉 ∈ V ∧ 𝑊 ∈ V) ∧ 𝐾 ∉ 𝑉) → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
32ex 418 . 2 ((𝑉 ∈ V ∧ 𝑊 ∈ V) → (𝐾 ∉ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅))
41mpoxopxprcov0 8262 . . 3 (¬ (𝑉 ∈ V ∧ 𝑊 ∈ V) → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
54a1d 26 . 2 (¬ (𝑉 ∈ V ∧ 𝑊 ∈ V) → (𝐾 ∉ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅))
63, 5pm2.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  Vcvv 3454  ∅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-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:  mpoxopoveqd  8266
  Copyright terms: Public domain W3C validator