Theorem aiota0ndef 48261

Description: Example for an undefined alternate iota being no set, i.e., ∀𝑦𝑦 ∈ 𝑥 is a wff not satisfied by a (unique) value 𝑥 (there is no set, and therefore certainly no unique set, which contains every set). This is different from iota0ndef 48203, where the iota still is a set (the empty set). (Contributed by AV, 25-Aug-2022.)

Assertion

Ref	Expression
aiota0ndef	⊢ (℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∉ V

Distinct variable group:   𝑥,𝑦

Proof of Theorem aiota0ndef

Step	Hyp	Ref	Expression
1		nalset 5267	. . . 4 ⊢ ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥
2	1	intnanr 493	. . 3 ⊢ ¬ (∃𝑥∀𝑦 𝑦 ∈ 𝑥 ∧ ∃*𝑥∀𝑦 𝑦 ∈ 𝑥)
3		df-eu 2594	. . 3 ⊢ (∃!𝑥∀𝑦 𝑦 ∈ 𝑥 ↔ (∃𝑥∀𝑦 𝑦 ∈ 𝑥 ∧ ∃*𝑥∀𝑦 𝑦 ∈ 𝑥))
4	2, 3	mtbir 326	. 2 ⊢ ¬ ∃!𝑥∀𝑦 𝑦 ∈ 𝑥
5		df-nel 3062	. . 3 ⊢ ((℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∉ V ↔ ¬ (℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∈ V)
6		aiotaexb 48253	. . 3 ⊢ (∃!𝑥∀𝑦 𝑦 ∈ 𝑥 ↔ (℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∈ V)
7	5, 6	xchbinxr 338	. 2 ⊢ ((℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∉ V ↔ ¬ ∃!𝑥∀𝑦 𝑦 ∈ 𝑥)
8	4, 7	mpbir 234	1 ⊢ (℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∉ V

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401  ∀wal 1567  ∃wex 1811   ∈ wcel 2144  ∃*wmo 2562  ∃!weu 2593   ∉ wnel 3061  Vcvv 3450  ℩'caiota 48247

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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-nul 4279  df-sn 4585  df-int 4907  df-aiota 48249

This theorem is used by: (None)