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

Theorem mpoxopynvov0g 8234
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
mpoxopynvov0g (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∉ 𝑉) → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
Distinct variable groups:   𝑥,𝑦   𝑥,𝐾   𝑥,𝑉   𝑥,𝑊
Allowed substitution hints:   𝐶(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝐾(𝑦)   𝑉(𝑦)   𝑊(𝑦)   𝑋(𝑥, 𝑦)   𝑌(𝑥, 𝑦)

Proof of Theorem mpoxopynvov0g
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 neq0 4298 . . . 4 (¬ (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅ ↔ ∃𝑛 𝑛 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾))
2 mpoxopn0yelv.f . . . . . . 7 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶)
32mpoxopn0yelv 8233 . . . . . 6 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑛 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ 𝑉))
4 nnel 3071 . . . . . 6 (¬ 𝐾 ∉ 𝑉 ↔ 𝐾 ∈ 𝑉)
53, 4imbitrrdi 255 . . . . 5 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑛 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ¬ 𝐾 ∉ 𝑉))
65exlimdv 1965 . . . 4 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (∃𝑛 𝑛 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ¬ 𝐾 ∉ 𝑉))
71, 6biimtrid 245 . . 3 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (¬ (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅ → ¬ 𝐾 ∉ 𝑉))
87con4d 116 . 2 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∉ 𝑉 → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅))
98imp 412 1 (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∉ 𝑉) → (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ∉ wnel 3061  Vcvv 3450  ∅c0 4278  ⟨cop 4834  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  1st c1st 7999
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002
This theorem is used by:  mpoxopynvov0  8238
  Copyright terms: Public domain W3C validator