Theorem reutru 46039

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 1543	. . . 4 ⊢ ⊤
2	1	biantru 529	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ⊤))
3	2	eubii 2585	. 2 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
4		df-reu 3070	. 2 ⊢ (∃!𝑥 ∈ 𝐴 ⊤ ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
5	3, 4	bitr4i 277	1 ⊢ (∃!𝑥 𝑥 ∈ 𝐴 ↔ ∃!𝑥 ∈ 𝐴 ⊤)

Syntax hints:   ↔ wb 205   ∧ wa 395  ⊤wtru 1540   ∈ wcel 2108  ∃!weu 2568  ∃!wreu 3065

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-ex 1784  df-mo 2540  df-eu 2569  df-reu 3070

This theorem is referenced by: (None)