Theorem rmotru 48526

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 1541	. . . 4 ⊢ ⊤
2	1	biantru 529	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ⊤))
3	2	mobii 2551	. 2 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
4		df-rmo 3388	. 2 ⊢ (∃*𝑥 ∈ 𝐴 ⊤ ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ ⊤))
5	3, 4	bitr4i 278	1 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∃*𝑥 ∈ 𝐴 ⊤)

Syntax hints:   ↔ wb 206   ∧ wa 395  ⊤wtru 1538   ∈ wcel 2108  ∃*wmo 2541  ∃*wrmo 3387

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

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-mo 2543  df-rmo 3388

This theorem is referenced by:  reutruALT  48528  mosn  48534