![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > reuanid | Structured version Visualization version GIF version |
Description: Cancellation law for restricted unique existential quantification. (Contributed by Peter Mazsa, 12-Feb-2018.) |
Ref | Expression |
---|---|
reuanid | ⊢ (∃!𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | anabs5 662 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | 1 | eubii 2645 | . 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) |
3 | df-reu 3113 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑))) | |
4 | df-reu 3113 | . 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
5 | 2, 3, 4 | 3bitr4i 306 | 1 ⊢ (∃!𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃!𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∈ wcel 2111 ∃!weu 2628 ∃!wreu 3108 |
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-eu 2629 df-reu 3113 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |