Theorem aiotaint 47006

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

Assertion

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

Proof of Theorem aiotaint

Step	Hyp	Ref	Expression
1		reuaiotaiota 47003	. . 3 ⊢ (∃!𝑥𝜑 ↔ (℩𝑥𝜑) = (℩'𝑥𝜑))
2	1	biimpi 216	. 2 ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) = (℩'𝑥𝜑))
3		iotaint 6549	. 2 ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) = ∩ {𝑥 ∣ 𝜑})
4	2, 3	eqtr3d 2782	1 ⊢ (∃!𝑥𝜑 → (℩'𝑥𝜑) = ∩ {𝑥 ∣ 𝜑})

Syntax hints:   → wi 4   = wceq 1537  ∃!weu 2571  {cab 2717  ∩ cint 4970  ℩cio 6523  ℩'caiota 46998

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-8 2110  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-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-sn 4649  df-pr 4651  df-uni 4932  df-int 4971  df-iota 6525  df-aiota 47000

This theorem is referenced by:  dfaiota3  47007