Theorem moor 2068

Description: "At most one" is still the case when a disjunct is removed. (Contributed by NM, 5-Apr-2004.)

Assertion

Ref	Expression
moor	⊢ (∃*𝑥(𝜑 ∨ 𝜓) → ∃*𝑥𝜑)

Proof of Theorem moor

Step	Hyp	Ref	Expression
1		orc 701	. 2 ⊢ (𝜑 → (𝜑 ∨ 𝜓))
2	1	moimi 2062	1 ⊢ (∃*𝑥(𝜑 ∨ 𝜓) → ∃*𝑥𝜑)

Syntax hints:   → wi 4   ∨ wo 697  ∃*wmo 1998

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515

This theorem depends on definitions:  df-bi 116  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001

This theorem is referenced by:  mooran2  2070