Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mormo | Structured version Visualization version GIF version |
Description: Unrestricted "at most one" implies restricted "at most one". (Contributed by NM, 16-Jun-2017.) |
Ref | Expression |
---|---|
mormo | ⊢ (∃*𝑥𝜑 → ∃*𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | moan 2570 | . 2 ⊢ (∃*𝑥𝜑 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | df-rmo 3078 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | 1, 2 | sylibr 237 | 1 ⊢ (∃*𝑥𝜑 → ∃*𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2111 ∃*wmo 2555 ∃*wrmo 3073 |
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 2557 df-rmo 3078 |
This theorem is referenced by: reueq 3653 reusv1 5269 brdom4 9995 phpreu 35347 |
Copyright terms: Public domain | W3C validator |