Theorem iota0def 47934

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 5268	. 2 ⊢ ∅ ∈ V
2		al0ssb 5269	. . . 4 ⊢ (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)
3	2	a1i 11	. . 3 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅))
4	3	iota5 6520	. 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 2145  Vcvv 3453   ⊆ wss 3902  ∅c0 4282  ℩cio 6491

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 2147  ax-9 2155  ax-ext 2734  ax-nul 5267

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-sn 4588  df-pr 4590  df-uni 4871  df-iota 6493

This theorem is used by: (None)