Theorem aiota0def 47559

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 47501. (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 5229	. 2 ⊢ ∅ ∈ V
2		al0ssb 5230	. . 3 ⊢ (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)
3	2	ax-gen 1802	. 2 ⊢ ∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)
4		eqeq2 2751	. . . . . 6 ⊢ (𝑧 = ∅ → (𝑥 = 𝑧 ↔ 𝑥 = ∅))
5	4	bibi2d 343	. . . . 5 ⊢ (𝑧 = ∅ → ((∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) ↔ (∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)))
6	5	albidv 1927	. . . 4 ⊢ (𝑧 = ∅ → (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) ↔ ∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅)))
7		eqeq2 2751	. . . 4 ⊢ (𝑧 = ∅ → ((℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = 𝑧 ↔ (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅))
8	6, 7	imbi12d 345	. . 3 ⊢ (𝑧 = ∅ → ((∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = 𝑧) ↔ (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅)))
9		aiotaval 47558	. . 3 ⊢ (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = 𝑧) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = 𝑧)
10	8, 9	vtoclg 3500	. 2 ⊢ (∅ ∈ V → (∀𝑥(∀𝑦 𝑥 ⊆ 𝑦 ↔ 𝑥 = ∅) → (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅))
11	1, 3, 10	mp2 9	1 ⊢ (℩'𝑥∀𝑦 𝑥 ⊆ 𝑦) = ∅

Syntax hints:   → wi 4   ↔ wb 207  ∀wal 1545   = wceq 1547   ∈ wcel 2119  Vcvv 3431   ⊆ wss 3883  ∅c0 4261  ℩'caiota 47546

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-nul 5228

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-sn 4556  df-pr 4558  df-uni 4839  df-int 4878  df-iota 6441  df-aiota 47548

This theorem is referenced by: (None)