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

Theorem mpoxneldm 7999
Description: If the first argument of an operation given by a maps-to rule is not an element of the first component of the domain or the second argument is not an element of the second component of the domain depending on the first argument, then the value of the operation is the empty set. (Contributed by AV, 25-Oct-2020.)
Hypothesis
Ref Expression
mpoxeldm.f 𝐹 = (𝑥𝐶, 𝑦𝐷𝑅)
Assertion
Ref Expression
mpoxneldm ((𝑋𝐶𝑌𝑋 / 𝑥𝐷) → (𝑋𝐹𝑌) = ∅)
Distinct variable groups:   𝑥,𝐶,𝑦   𝑦,𝐷   𝑥,𝑋   𝑥,𝑌
Allowed substitution hints:   𝐷(𝑥)   𝑅(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝑋(𝑦)   𝑌(𝑦)

Proof of Theorem mpoxneldm
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 df-nel 3049 . . . 4 (𝑋𝐶 ↔ ¬ 𝑋𝐶)
2 df-nel 3049 . . . 4 (𝑌𝑋 / 𝑥𝐷 ↔ ¬ 𝑌𝑋 / 𝑥𝐷)
31, 2orbi12i 911 . . 3 ((𝑋𝐶𝑌𝑋 / 𝑥𝐷) ↔ (¬ 𝑋𝐶 ∨ ¬ 𝑌𝑋 / 𝑥𝐷))
4 ianor 978 . . 3 (¬ (𝑋𝐶𝑌𝑋 / 𝑥𝐷) ↔ (¬ 𝑋𝐶 ∨ ¬ 𝑌𝑋 / 𝑥𝐷))
53, 4bitr4i 277 . 2 ((𝑋𝐶𝑌𝑋 / 𝑥𝐷) ↔ ¬ (𝑋𝐶𝑌𝑋 / 𝑥𝐷))
6 neq0 4276 . . . 4 (¬ (𝑋𝐹𝑌) = ∅ ↔ ∃𝑛 𝑛 ∈ (𝑋𝐹𝑌))
7 mpoxeldm.f . . . . . 6 𝐹 = (𝑥𝐶, 𝑦𝐷𝑅)
87mpoxeldm 7998 . . . . 5 (𝑛 ∈ (𝑋𝐹𝑌) → (𝑋𝐶𝑌𝑋 / 𝑥𝐷))
98exlimiv 1934 . . . 4 (∃𝑛 𝑛 ∈ (𝑋𝐹𝑌) → (𝑋𝐶𝑌𝑋 / 𝑥𝐷))
106, 9sylbi 216 . . 3 (¬ (𝑋𝐹𝑌) = ∅ → (𝑋𝐶𝑌𝑋 / 𝑥𝐷))
1110con1i 147 . 2 (¬ (𝑋𝐶𝑌𝑋 / 𝑥𝐷) → (𝑋𝐹𝑌) = ∅)
125, 11sylbi 216 1 ((𝑋𝐶𝑌𝑋 / 𝑥𝐷) → (𝑋𝐹𝑌) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 843   = wceq 1539  wex 1783  wcel 2108  wnel 3048  csb 3828  c0 4253  (class class class)co 7255  cmpo 7257
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805
This theorem is referenced by:  nbgrnvtx0  27609
  Copyright terms: Public domain W3C validator