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

Theorem riotaund 7364
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 7325 . 2 (𝑥𝐴 𝜑) = (℩𝑥(𝑥𝐴𝜑))
2 df-reu 3353 . . 3 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
3 iotanul 6480 . . 3 (¬ ∃!𝑥(𝑥𝐴𝜑) → (℩𝑥(𝑥𝐴𝜑)) = ∅)
42, 3sylnbi 330 . 2 (¬ ∃!𝑥𝐴 𝜑 → (℩𝑥(𝑥𝐴𝜑)) = ∅)
51, 4eqtrid 2784 1 (¬ ∃!𝑥𝐴 𝜑 → (𝑥𝐴 𝜑) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  ∃!weu 2569  ∃!wreu 3350  c0 4287  cio 6454  crio 7324
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-reu 3353  df-v 3444  df-dif 3906  df-ss 3920  df-nul 4288  df-sn 4583  df-uni 4866  df-iota 6456  df-riota 7325
This theorem is referenced by:  riotassuni  7365  riotaclb  7366  supval2  9370  lubval  18289  glbval  18302  grpinvfval  18920  finxpreclem4  37649
  Copyright terms: Public domain W3C validator