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

Theorem mpoxopynvov0g 8215
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 4299 . . . 4 (¬ (⟨𝑉, 𝑊⟩𝐹𝐾) = ∅ ↔ ∃𝑛 𝑛 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾))
2 mpoxopn0yelv.f . . . . . . 7 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶)
32mpoxopn0yelv 8214 . . . . . 6 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑛 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ 𝑉))
4 nnel 3072 . . . . . 6 (¬ 𝐾 ∉ 𝑉 ↔ 𝐾 ∈ 𝑉)
53, 4imbitrrdi 255 . . . . 5 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑛 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ¬ 𝐾 ∉ 𝑉))
65exlimdv 1966 . . . 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 1570  ∃wex 1812   ∈ wcel 2145   ∉ wnel 3062  Vcvv 3451  ∅c0 4279  ⟨cop 4590  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991
This theorem is used by:  mpoxopynvov0  8219
  Copyright terms: Public domain W3C validator