Theorem rmoanid 3299

Description: Cancellation law for restricted at-most-one quantification. (Contributed by Peter Mazsa, 24-May-2018.)

Assertion

Ref	Expression
rmoanid	⊢ (∃*𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥 ∈ 𝐴 𝜑)

Proof of Theorem rmoanid

Step	Hyp	Ref	Expression
1		anabs5 660	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))
2	1	mobii 2548	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
3		df-rmo 3071	. 2 ⊢ (∃*𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)))
4		df-rmo 3071	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
5	2, 3, 4	3bitr4i 303	1 ⊢ (∃*𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥 ∈ 𝐴 𝜑)

Syntax hints:   ↔ wb 205   ∧ wa 396   ∈ wcel 2106  ∃*wmo 2538  ∃*wrmo 3067

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

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-mo 2540  df-rmo 3071

This theorem is referenced by: (None)