Theorem aiotaint 48269

Description: This is to df-aiota 48263 what iotauni 6519 is to df-iota 6497 (it uses intersection like df-aiota 48263, similar to iotauni 6519 using union like df-iota 6497; we could also prove an analogous result using union here too, in the same way that we have iotaint 6520). (Contributed by BJ, 31-Aug-2024.)

Assertion

Ref	Expression
aiotaint	⊢ (∃!𝑥𝜑 → (℩'𝑥𝜑) = ∩ {𝑥 ∣ 𝜑})

Proof of Theorem aiotaint

Step	Hyp	Ref	Expression
1		reuaiotaiota 48266	. . 3 ⊢ (∃!𝑥𝜑 ↔ (℩𝑥𝜑) = (℩'𝑥𝜑))
2	1	biimpi 219	. 2 ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) = (℩'𝑥𝜑))
3		iotaint 6520	. 2 ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) = ∩ {𝑥 ∣ 𝜑})
4	2, 3	eqtr3d 2797	1 ⊢ (∃!𝑥𝜑 → (℩'𝑥𝜑) = ∩ {𝑥 ∣ 𝜑})

This proof depends on syntax axioms:   → wi 4   = wceq 1569  ∃!weu 2593  {cab 2738  ∩ cint 4906  ℩cio 6495  ℩'caiota 48261

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-8 2146  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-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-sn 4585  df-pr 4587  df-uni 4867  df-int 4907  df-iota 6497  df-aiota 48263

This theorem is used by:  dfaiota3  48270