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

Theorem riotaund 7153
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 7114 . 2 (𝑥𝐴 𝜑) = (℩𝑥(𝑥𝐴𝜑))
2 df-reu 3145 . . 3 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
3 iotanul 6333 . . 3 (¬ ∃!𝑥(𝑥𝐴𝜑) → (℩𝑥(𝑥𝐴𝜑)) = ∅)
42, 3sylnbi 332 . 2 (¬ ∃!𝑥𝐴 𝜑 → (℩𝑥(𝑥𝐴𝜑)) = ∅)
51, 4syl5eq 2868 1 (¬ ∃!𝑥𝐴 𝜑 → (𝑥𝐴 𝜑) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1537  wcel 2114  ∃!weu 2653  ∃!wreu 3140  c0 4291  cio 6312  crio 7113
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-reu 3145  df-v 3496  df-dif 3939  df-in 3943  df-ss 3952  df-nul 4292  df-sn 4568  df-uni 4839  df-iota 6314  df-riota 7114
This theorem is referenced by:  riotassuni  7154  riotaclb  7155  supval2  8919  lubval  17594  glbval  17607  grpinvfval  18142  finxpreclem4  34678
  Copyright terms: Public domain W3C validator