Theorem dfaiota2 48232

Description: Alternate definition of the alternate version of Russell's definition of a description binder. Definition 8.18 in [Quine] p. 56. (Contributed by AV, 24-Aug-2022.)

Assertion

Ref	Expression
dfaiota2	⊢ (℩'𝑥𝜑) = ∩ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem dfaiota2

Step	Hyp	Ref	Expression
1		df-aiota 48231	. 2 ⊢ (℩'𝑥𝜑) = ∩ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}}
2		absn 4603	. . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑦} ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦))
3	2	abbii 2827	. . 3 ⊢ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}
4	3	inteqi 4910	. 2 ⊢ ∩ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = ∩ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}
5	1, 4	eqtri 2783	1 ⊢ (℩'𝑥𝜑) = ∩ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}

This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1567   = wceq 1569  {cab 2738  {csn 4583  ∩ cint 4906  ℩'caiota 48229

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-ral 3077  df-rex 3087  df-sn 4584  df-int 4907  df-aiota 48231

This theorem is used by: (None)