Theorem dfaiota2 46092

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 46091	. 2 ⊢ (℩'𝑥𝜑) = ∩ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}}
2		absn 4645	. . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑦} ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦))
3	2	abbii 2800	. . 3 ⊢ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}
4	3	inteqi 4953	. 2 ⊢ ∩ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = ∩ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}
5	1, 4	eqtri 2758	1 ⊢ (℩'𝑥𝜑) = ∩ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}

Syntax hints:   ↔ wb 205  ∀wal 1537   = wceq 1539  {cab 2707  {csn 4627  ∩ cint 4949  ℩'caiota 46089

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-tru 1542  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2722  df-ral 3060  df-rex 3069  df-sn 4628  df-int 4950  df-aiota 46091

This theorem is referenced by: (None)