Theorem iota0def 48201

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

Step	Hyp	Ref	Expression
1		0ex 5260	. 2 ⊢ ∅ ∈ V
2		al0ssb 5261	. . . 4 ⊢ (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)
3	2	a1i 11	. . 3 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅))
4	3	iota5 6521	. 2 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (℩𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅)
5	1, 1, 4	mp2an 705	1 ⊢ (℩𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895  ∅c0 4278  ℩cio 6492

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-sn 4585  df-pr 4587  df-uni 4867  df-iota 6494

This theorem is used by: (None)