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 47809
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 5282 . . . 4 ¬ ∃𝑥𝑦 𝑦𝑥
21intnanr 493 . . 3 ¬ (∃𝑥𝑦 𝑦𝑥 ∧ ∃*𝑥𝑦 𝑦𝑥)
3 df-eu 2600 . . 3 (∃!𝑥𝑦 𝑦𝑥 ↔ (∃𝑥𝑦 𝑦𝑥 ∧ ∃*𝑥𝑦 𝑦𝑥))
42, 3mtbir 326 . 2 ¬ ∃!𝑥𝑦 𝑦𝑥
5 iotanul 6523 . 2 (¬ ∃!𝑥𝑦 𝑦𝑥 → (℩𝑥𝑦 𝑦𝑥) = ∅)
64, 5ax-mp 5 1 (℩𝑥𝑦 𝑦𝑥) = ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wa 401  wal 1568   = wceq 1570  wex 1812  ∃*wmo 2568  ∃!weu 2599  c0 4289  cio 6497
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-v 3460  df-dif 3911  df-ss 3925  df-nul 4290  df-sn 4595  df-uni 4878  df-iota 6499
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator