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

Theorem riotaund 7132
Description: Restricted iota equals the empty set when not meaningful. (Contributed by NM, 16-Jan-2012.) (Revised by Mario Carneiro, 15-Oct-2016.) (Revised by NM, 13-Sep-2018.)
Assertion
Ref Expression
riotaund (¬ ∃!𝑥𝐴 𝜑 → (𝑥𝐴 𝜑) = ∅)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem riotaund
StepHypRef Expression
1 df-riota 7093 . 2 (𝑥𝐴 𝜑) = (℩𝑥(𝑥𝐴𝜑))
2 df-reu 3113 . . 3 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
3 iotanul 6302 . . 3 (¬ ∃!𝑥(𝑥𝐴𝜑) → (℩𝑥(𝑥𝐴𝜑)) = ∅)
42, 3sylnbi 333 . 2 (¬ ∃!𝑥𝐴 𝜑 → (℩𝑥(𝑥𝐴𝜑)) = ∅)
51, 4syl5eq 2845 1 (¬ ∃!𝑥𝐴 𝜑 → (𝑥𝐴 𝜑) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399   = wceq 1538  wcel 2111  ∃!weu 2628  ∃!wreu 3108  c0 4243  cio 6281  crio 7092
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-rex 3112  df-reu 3113  df-v 3443  df-dif 3884  df-in 3888  df-ss 3898  df-nul 4244  df-sn 4526  df-uni 4801  df-iota 6283  df-riota 7093
This theorem is referenced by:  riotassuni  7133  riotaclb  7134  supval2  8903  lubval  17586  glbval  17599  grpinvfval  18134  finxpreclem4  34811
  Copyright terms: Public domain W3C validator