Theorem dfaiota2 47003

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 47002	. 2 ⊢ (℩'𝑥𝜑) = ∩ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}}
2		absn 4667	. . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑦} ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦))
3	2	abbii 2812	. . 3 ⊢ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}
4	3	inteqi 4974	. 2 ⊢ ∩ {𝑦 ∣ {𝑥 ∣ 𝜑} = {𝑦}} = ∩ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}
5	1, 4	eqtri 2768	1 ⊢ (℩'𝑥𝜑) = ∩ {𝑦 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦)}

Syntax hints:   ↔ wb 206  ∀wal 1535   = wceq 1537  {cab 2717  {csn 4648  ∩ cint 4970  ℩'caiota 47000

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-ral 3068  df-rex 3077  df-sn 4649  df-int 4971  df-aiota 47002

This theorem is referenced by: (None)