Theorem iota0def 48323

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 5265	. 2 ⊢ ∅ ∈ V
2		al0ssb 5266	. . . 4 ⊢ (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)
3	2	a1i 11	. . 3 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅))
4	3	iota5 6543	. 2 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (℩𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅)
5	1, 1, 4	mp2an 705	1 ⊢ (℩𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  ℩cio 6513

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-nul 5264

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-sn 4589  df-pr 4591  df-uni 4871  df-iota 6515

This theorem is used by: (None)