Theorem aiota0def 45790

Description: Example for a defined alternate 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). This corresponds to iota0def 45734. (Contributed by AV, 25-Aug-2022.)

Assertion

Ref	Expression
aiota0def	⊢ (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅

Distinct variable group:   𝑥,𝑦

Proof of Theorem aiota0def

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		0ex 5306	. 2 ⊢ ∅ ∈ V
2		al0ssb 5307	. . 3 ⊢ (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)
3	2	ax-gen 1797	. 2 ⊢ ∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)
4		eqeq2 2744	. . . . . 6 ⊢ (𝑧 = ∅ → (𝑥 = 𝑧 ↔ 𝑥 = ∅))
5	4	bibi2d 342	. . . . 5 ⊢ (𝑧 = ∅ → ((∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) ↔ (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)))
6	5	albidv 1923	. . . 4 ⊢ (𝑧 = ∅ → (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) ↔ ∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)))
7		eqeq2 2744	. . . 4 ⊢ (𝑧 = ∅ → ((℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = 𝑧 ↔ (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅))
8	6, 7	imbi12d 344	. . 3 ⊢ (𝑧 = ∅ → ((∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = 𝑧) ↔ (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅)))
9		aiotaval 45789	. . 3 ⊢ (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = 𝑧)
10	8, 9	vtoclg 3556	. 2 ⊢ (∅ ∈ V → (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅))
11	1, 3, 10	mp2 9	1 ⊢ (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1539   = wceq 1541   ∈ wcel 2106  Vcvv 3474   ⊆ wss 3947  ∅c0 4321  ℩'caiota 45777

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-nul 5305

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-sn 4628  df-pr 4630  df-uni 4908  df-int 4950  df-iota 6492  df-aiota 45779

This theorem is referenced by: (None)