![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rmoanid | Structured version Visualization version GIF version |
Description: Cancellation law for restricted at-most-one quantification. (Contributed by Peter Mazsa, 24-May-2018.) |
Ref | Expression |
---|---|
rmoanid | ⊢ (∃*𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | anabs5 662 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | 1 | mobii 2606 | . 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) |
3 | df-rmo 3114 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑))) | |
4 | df-rmo 3114 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
5 | 2, 3, 4 | 3bitr4i 306 | 1 ⊢ (∃*𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃*𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∈ wcel 2111 ∃*wmo 2596 ∃*wrmo 3109 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-mo 2598 df-rmo 3114 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |