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

Theorem iota0def 43798
 Description: Example for a defined iota being the empty set, i.e., ∀𝑦𝑥 ⊆ 𝑦 is a wff satisfied by a unique value 𝑥, namely 𝑥 = ∅ (the empty set is the one and only set which is a subset of every set). (Contributed by AV, 24-Aug-2022.)
Assertion
Ref Expression
iota0def (℩𝑥𝑦 𝑥𝑦) = ∅
Distinct variable group:   𝑥,𝑦

Proof of Theorem iota0def
StepHypRef Expression
1 0ex 5179 . 2 ∅ ∈ V
2 al0ssb 5180 . . . 4 (∀𝑦 𝑥𝑦𝑥 = ∅)
32a1i 11 . . 3 ((∅ ∈ V ∧ ∅ ∈ V) → (∀𝑦 𝑥𝑦𝑥 = ∅))
43iota5 6315 . 2 ((∅ ∈ V ∧ ∅ ∈ V) → (℩𝑥𝑦 𝑥𝑦) = ∅)
51, 1, 4mp2an 691 1 (℩𝑥𝑦 𝑥𝑦) = ∅
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399  ∀wal 1536   = wceq 1538   ∈ wcel 2111  Vcvv 3442   ⊆ wss 3883  ∅c0 4246  ℩cio 6289 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  ax-nul 5178 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-clab 2777  df-cleq 2791  df-clel 2870  df-v 3444  df-sbc 3723  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4247  df-sn 4529  df-pr 4531  df-uni 4805  df-iota 6291 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator