Metamath Proof Explorer


Theorem aiota0ndef

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

Ref Expression
Assertion aiota0ndef ( ℩' 𝑥𝑦 𝑦𝑥 ) ∉ V

Proof

Step Hyp Ref Expression
1 nalset ¬ ∃ 𝑥𝑦 𝑦𝑥
2 1 intnanr ¬ ( ∃ 𝑥𝑦 𝑦𝑥 ∧ ∃* 𝑥𝑦 𝑦𝑥 )
3 df-eu ( ∃! 𝑥𝑦 𝑦𝑥 ↔ ( ∃ 𝑥𝑦 𝑦𝑥 ∧ ∃* 𝑥𝑦 𝑦𝑥 ) )
4 2 3 mtbir ¬ ∃! 𝑥𝑦 𝑦𝑥
5 df-nel ( ( ℩' 𝑥𝑦 𝑦𝑥 ) ∉ V ↔ ¬ ( ℩' 𝑥𝑦 𝑦𝑥 ) ∈ V )
6 aiotaexb ( ∃! 𝑥𝑦 𝑦𝑥 ↔ ( ℩' 𝑥𝑦 𝑦𝑥 ) ∈ V )
7 5 6 xchbinxr ( ( ℩' 𝑥𝑦 𝑦𝑥 ) ∉ V ↔ ¬ ∃! 𝑥𝑦 𝑦𝑥 )
8 4 7 mpbir ( ℩' 𝑥𝑦 𝑦𝑥 ) ∉ V