Theorem rmotru 49466

Description: Two ways of expressing "at most one" element. (Contributed by Zhi Wang, 19-Sep-2024.) (Proof shortened by BJ, 23-Sep-2024.)

Assertion

Ref	Expression
rmotru	⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃*𝑥 ∈ 𝐴 ⊤)

Proof of Theorem rmotru

Step	Hyp	Ref	Expression
1		tru 1571	. . . 4 ⊢ ⊤
2	1	biantru 538	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ⊤))
3	2	mobii 2582	. 2 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
4		df-rmo 3376	. 2 ⊢ (∃*𝑥 ∈ 𝐴 ⊤ ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
5	3, 4	bitr4i 281	1 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃*𝑥 ∈ 𝐴 ⊤)

Syntax hints:   ↔ wb 209   ∧ wa 400  ⊤wtru 1568   ∈ wcel 2149  ∃*wmo 2571  ∃*wrmo 3375

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-mo 2573  df-rmo 3376

This theorem is referenced by:  reutruALT  49468  mosn  49476