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 2552 | . 2 ⊢ (∃*𝑥𝜑 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | df-rmo 3071 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | 1, 2 | sylibr 233 | 1 ⊢ (∃*𝑥𝜑 → ∃*𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ 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: reueq 3672 reusv1 5320 brdom4 10286 phpreu 35761 |
Copyright terms: Public domain | W3C validator |