![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ralnralall | Structured version Visualization version GIF version |
Description: A contradiction concerning restricted generalization for a nonempty set implies anything. (Contributed by Alexander van der Vekens, 4-Sep-2018.) |
Ref | Expression |
---|---|
ralnralall | ⊢ (𝐴 ≠ ∅ → ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝜑) → 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.26 3117 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜑) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝜑)) | |
2 | pm3.24 402 | . . . . 5 ⊢ ¬ (𝜑 ∧ ¬ 𝜑) | |
3 | 2 | bifal 1553 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝜑) ↔ ⊥) |
4 | 3 | ralbii 3099 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜑) ↔ ∀𝑥 ∈ 𝐴 ⊥) |
5 | r19.3rzv 4522 | . . . 4 ⊢ (𝐴 ≠ ∅ → (⊥ ↔ ∀𝑥 ∈ 𝐴 ⊥)) | |
6 | falim 1554 | . . . 4 ⊢ (⊥ → 𝜓) | |
7 | 5, 6 | biimtrrdi 254 | . . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 ⊥ → 𝜓)) |
8 | 4, 7 | biimtrid 242 | . 2 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜑) → 𝜓)) |
9 | 1, 8 | biimtrrid 243 | 1 ⊢ (𝐴 ≠ ∅ → ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝜑) → 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ⊥wfal 1549 ≠ wne 2946 ∀wral 3067 ∅c0 4352 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-9 2118 ax-12 2178 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-ne 2947 df-ral 3068 df-dif 3979 df-nul 4353 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |