Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > moor | Structured version Visualization version GIF version |
Description: "At most one" is still the case when a disjunct is removed. (Contributed by NM, 5-Apr-2004.) |
Ref | Expression |
---|---|
moor | ⊢ (∃*𝑥(𝜑 ∨ 𝜓) → ∃*𝑥𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | orc 864 | . 2 ⊢ (𝜑 → (𝜑 ∨ 𝜓)) | |
2 | 1 | moimi 2545 | 1 ⊢ (∃*𝑥(𝜑 ∨ 𝜓) → ∃*𝑥𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 844 ∃*wmo 2538 |
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-or 845 df-ex 1783 df-mo 2540 |
This theorem is referenced by: mooran2 2556 |
Copyright terms: Public domain | W3C validator |