Theorem reutru 48991

Description: Two ways of expressing "exactly one" element. (Contributed by Zhi Wang, 23-Sep-2024.)

Assertion

Ref	Expression
reutru	⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 ∈ 𝐴 ⊤)

Proof of Theorem reutru

Step	Hyp	Ref	Expression
1		tru 1545	. . . 4 ⊢ ⊤
2	1	biantru 529	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ⊤))
3	2	eubii 2583	. 2 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
4		df-reu 3349	. 2 ⊢ (∃!𝑥 ∈ 𝐴 ⊤ ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
5	3, 4	bitr4i 278	1 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 ∈ 𝐴 ⊤)

Syntax hints:   ↔ wb 206   ∧ wa 395  ⊤wtru 1542   ∈ wcel 2113  ∃!weu 2566  ∃!wreu 3346

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-mo 2537  df-eu 2567  df-reu 3349

This theorem is referenced by:  isinito2lem  49685