| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > falseral0 | Structured version Visualization version GIF version | ||
| Description: A false statement can only be true for elements of an empty set. (Contributed by AV, 30-Oct-2020.) |
| Ref | Expression |
|---|---|
| falseral0 | ⊢ ((∀𝑥 ¬ 𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜑) → 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 3048 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
| 2 | 19.26 1871 | . . 3 ⊢ (∀𝑥(¬ 𝜑 ∧ (𝑥 ∈ 𝐴 → 𝜑)) ↔ (∀𝑥 ¬ 𝜑 ∧ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))) | |
| 3 | con3 153 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 → 𝜑) → (¬ 𝜑 → ¬ 𝑥 ∈ 𝐴)) | |
| 4 | 3 | impcom 407 | . . . . . 6 ⊢ ((¬ 𝜑 ∧ (𝑥 ∈ 𝐴 → 𝜑)) → ¬ 𝑥 ∈ 𝐴) |
| 5 | 4 | alimi 1812 | . . . . 5 ⊢ (∀𝑥(¬ 𝜑 ∧ (𝑥 ∈ 𝐴 → 𝜑)) → ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| 6 | alnex 1782 | . . . . 5 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝐴 ↔ ¬ ∃𝑥 𝑥 ∈ 𝐴) | |
| 7 | 5, 6 | sylib 218 | . . . 4 ⊢ (∀𝑥(¬ 𝜑 ∧ (𝑥 ∈ 𝐴 → 𝜑)) → ¬ ∃𝑥 𝑥 ∈ 𝐴) |
| 8 | notnotb 315 | . . . . 5 ⊢ (𝐴 = ∅ ↔ ¬ ¬ 𝐴 = ∅) | |
| 9 | neq0 4299 | . . . . 5 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 10 | 8, 9 | xchbinx 334 | . . . 4 ⊢ (𝐴 = ∅ ↔ ¬ ∃𝑥 𝑥 ∈ 𝐴) |
| 11 | 7, 10 | sylibr 234 | . . 3 ⊢ (∀𝑥(¬ 𝜑 ∧ (𝑥 ∈ 𝐴 → 𝜑)) → 𝐴 = ∅) |
| 12 | 2, 11 | sylbir 235 | . 2 ⊢ ((∀𝑥 ¬ 𝜑 ∧ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) → 𝐴 = ∅) |
| 13 | 1, 12 | sylan2b 594 | 1 ⊢ ((∀𝑥 ¬ 𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜑) → 𝐴 = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∀wal 1539 = wceq 1541 ∃wex 1780 ∈ wcel 2111 ∀wral 3047 ∅c0 4280 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-ral 3048 df-dif 3900 df-nul 4281 |
| This theorem is referenced by: uvtx01vtx 29375 |
| Copyright terms: Public domain | W3C validator |