Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iota0ndef Structured version   Visualization version   GIF version

Theorem iota0ndef 43323
Description: Example for an undefined iota being the empty set, i.e., 𝑦𝑦𝑥 is a wff not satisfied by a (unique) value 𝑥 (there is no set, and therefore certainly no unique set, which contains every set). (Contributed by AV, 24-Aug-2022.)
Assertion
Ref Expression
iota0ndef (℩𝑥𝑦 𝑦𝑥) = ∅
Distinct variable group:   𝑥,𝑦

Proof of Theorem iota0ndef
StepHypRef Expression
1 nalset 5217 . . . 4 ¬ ∃𝑥𝑦 𝑦𝑥
21intnanr 490 . . 3 ¬ (∃𝑥𝑦 𝑦𝑥 ∧ ∃*𝑥𝑦 𝑦𝑥)
3 df-eu 2654 . . 3 (∃!𝑥𝑦 𝑦𝑥 ↔ (∃𝑥𝑦 𝑦𝑥 ∧ ∃*𝑥𝑦 𝑦𝑥))
42, 3mtbir 325 . 2 ¬ ∃!𝑥𝑦 𝑦𝑥
5 iotanul 6333 . 2 (¬ ∃!𝑥𝑦 𝑦𝑥 → (℩𝑥𝑦 𝑦𝑥) = ∅)
64, 5ax-mp 5 1 (℩𝑥𝑦 𝑦𝑥) = ∅
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 398  wal 1535   = wceq 1537  wex 1780  ∃*wmo 2620  ∃!weu 2653  c0 4291  cio 6312
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  ax-sep 5203
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-v 3496  df-dif 3939  df-in 3943  df-ss 3952  df-nul 4292  df-sn 4568  df-uni 4839  df-iota 6314
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator