Theorem als-no-surprise 50641

Description: Demonstrate that there is never a "surprise" when using the allsome quantifier, that is, it is never possible for the consequent to be both always true and always false. This uses the definition of df-als 50623; the proof itself builds on alimp-no-surprise 50616. For a contrast, see alimp-surprise 50615. (Contributed by David A. Wheeler, 27-Oct-2018.)

Assertion

Ref	Expression
als-no-surprise	⊢ ¬ (∀∃𝑥(𝜑 → 𝜓) ∧ ∀∃𝑥(𝜑 → ¬ 𝜓))

Proof of Theorem als-no-surprise

Step	Hyp	Ref	Expression
1		alimp-no-surprise 50616	. 2 ⊢ ¬ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑)
2		df-als 50623	. . . 4 ⊢ (∀∃𝑥(𝜑 → 𝜓) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑))
3		df-als 50623	. . . 4 ⊢ (∀∃𝑥(𝜑 → ¬ 𝜓) ↔ (∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑))
4	2, 3	anbi12i 640	. . 3 ⊢ ((∀∃𝑥(𝜑 → 𝜓) ∧ ∀∃𝑥(𝜑 → ¬ 𝜓)) ↔ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑) ∧ (∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑)))
5		anandi3r 1120	. . 3 ⊢ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑 ∧ ∀𝑥(𝜑 → ¬ 𝜓)) ↔ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑) ∧ (∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑)))
6		3ancomb 1116	. . 3 ⊢ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑 ∧ ∀𝑥(𝜑 → ¬ 𝜓)) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑))
7	4, 5, 6	3bitr2i 302	. 2 ⊢ ((∀∃𝑥(𝜑 → 𝜓) ∧ ∀∃𝑥(𝜑 → ¬ 𝜓)) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑))
8	1, 7	mtbir 326	1 ⊢ ¬ (∀∃𝑥(𝜑 → 𝜓) ∧ ∀∃𝑥(𝜑 → ¬ 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568  ∃wex 1812  ∀∃wals 50621

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-ex 1813  df-als 50623

This theorem is used by:  rals-no-surprise  50642  alseu-no-surprise  50673