Theorem aiota0ndef 47875

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 47817, 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 5282	. . . 4 ⊢ ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥
2	1	intnanr 493	. . 3 ⊢ ¬ (∃𝑥∀𝑦 𝑦 ∈ 𝑥 ∧ ∃*𝑥∀𝑦 𝑦 ∈ 𝑥)
3		df-eu 2600	. . 3 ⊢ (∃!𝑥∀𝑦 𝑦 ∈ 𝑥 ↔ (∃𝑥∀𝑦 𝑦 ∈ 𝑥 ∧ ∃*𝑥∀𝑦 𝑦 ∈ 𝑥))
4	2, 3	mtbir 326	. 2 ⊢ ¬ ∃!𝑥∀𝑦 𝑦 ∈ 𝑥
5		df-nel 3068	. . 3 ⊢ ((℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∉ V ↔ ¬ (℩'𝑥∀𝑦 𝑦 ∈ 𝑥) ∈ V)
6		aiotaexb 47867	. . 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 1568  ∃wex 1812   ∈ wcel 2146  ∃*wmo 2568  ∃!weu 2599   ∉ wnel 3067  Vcvv 3458  ℩'caiota 47861

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-in 3915  df-ss 3925  df-nul 4290  df-sn 4595  df-int 4918  df-aiota 47863

This theorem is used by: (None)