Theorem aiotaint 48130

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

Assertion

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

Proof of Theorem aiotaint

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

This proof depends on syntax axioms:   → wi 4   = wceq 1570  ∃!weu 2594  {cab 2739  ∩ cint 4907  ℩cio 6491  ℩'caiota 48122

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-sn 4585  df-pr 4587  df-uni 4868  df-int 4908  df-iota 6493  df-aiota 48124

This theorem is used by:  dfaiota3  48131