![]() |
Mathbox for David A. Wheeler |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > alsi-no-surprise | Structured version Visualization version GIF version |
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-alsi 47835; the proof itself builds on alimp-no-surprise 47828. For a contrast, see alimp-surprise 47827. (Contributed by David A. Wheeler, 27-Oct-2018.) |
Ref | Expression |
---|---|
alsi-no-surprise | ⊢ ¬ (∀!𝑥(𝜑 → 𝜓) ∧ ∀!𝑥(𝜑 → ¬ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | alimp-no-surprise 47828 | . 2 ⊢ ¬ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑) | |
2 | df-alsi 47835 | . . . 4 ⊢ (∀!𝑥(𝜑 → 𝜓) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑)) | |
3 | df-alsi 47835 | . . . 4 ⊢ (∀!𝑥(𝜑 → ¬ 𝜓) ↔ (∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑)) | |
4 | 2, 3 | anbi12i 628 | . . 3 ⊢ ((∀!𝑥(𝜑 → 𝜓) ∧ ∀!𝑥(𝜑 → ¬ 𝜓)) ↔ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑) ∧ (∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑))) |
5 | anandi3r 1104 | . . 3 ⊢ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑 ∧ ∀𝑥(𝜑 → ¬ 𝜓)) ↔ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑) ∧ (∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑))) | |
6 | 3ancomb 1100 | . . 3 ⊢ ((∀𝑥(𝜑 → 𝜓) ∧ ∃𝑥𝜑 ∧ ∀𝑥(𝜑 → ¬ 𝜓)) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑)) | |
7 | 4, 5, 6 | 3bitr2i 299 | . 2 ⊢ ((∀!𝑥(𝜑 → 𝜓) ∧ ∀!𝑥(𝜑 → ¬ 𝜓)) ↔ (∀𝑥(𝜑 → 𝜓) ∧ ∀𝑥(𝜑 → ¬ 𝜓) ∧ ∃𝑥𝜑)) |
8 | 1, 7 | mtbir 323 | 1 ⊢ ¬ (∀!𝑥(𝜑 → 𝜓) ∧ ∀!𝑥(𝜑 → ¬ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1088 ∀wal 1540 ∃wex 1782 ∀!walsi 47833 |
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 398 df-3an 1090 df-ex 1783 df-alsi 47835 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |