| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > axc5c711 | Structured version Visualization version GIF version | ||
| Description: Proof of a single axiom that can replace ax-c5 39764, ax-c7 39766, and ax-11 2194 in a subsystem that includes these axioms plus ax-c4 39765 and ax-gen 1828 (and propositional calculus). See axc5c711toc5 39800, axc5c711toc7 39801, and axc5c711to11 39802 for the rederivation of those axioms. This theorem extends the idea in Scott Fenton's axc5c7 39792. (Contributed by NM, 18-Nov-2006.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axc5c711 | ⊢ ((∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦𝜑 → ∀𝑥𝜑) → 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-c5 39764 | . . 3 ⊢ (∀𝑦𝜑 → 𝜑) | |
| 2 | ax10fromc7 39776 | . . . 4 ⊢ (¬ ∀𝑦𝜑 → ∀𝑦 ¬ ∀𝑦𝜑) | |
| 3 | ax-c7 39766 | . . . . . 6 ⊢ (¬ ∀𝑥 ¬ ∀𝑥∀𝑦𝜑 → ∀𝑦𝜑) | |
| 4 | 3 | con1i 148 | . . . . 5 ⊢ (¬ ∀𝑦𝜑 → ∀𝑥 ¬ ∀𝑥∀𝑦𝜑) |
| 5 | 4 | alimi 1844 | . . . 4 ⊢ (∀𝑦 ¬ ∀𝑦𝜑 → ∀𝑦∀𝑥 ¬ ∀𝑥∀𝑦𝜑) |
| 6 | ax-11 2194 | . . . 4 ⊢ (∀𝑦∀𝑥 ¬ ∀𝑥∀𝑦𝜑 → ∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦𝜑) | |
| 7 | 2, 5, 6 | 3syl 19 | . . 3 ⊢ (¬ ∀𝑦𝜑 → ∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦𝜑) |
| 8 | 1, 7 | nsyl4 159 | . 2 ⊢ (¬ ∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦𝜑 → 𝜑) |
| 9 | ax-c5 39764 | . 2 ⊢ (∀𝑥𝜑 → 𝜑) | |
| 10 | 8, 9 | ja 188 | 1 ⊢ ((∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦𝜑 → ∀𝑥𝜑) → 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∀wal 1568 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-11 2194 ax-c5 39764 ax-c4 39765 ax-c7 39766 |
| This theorem is used by: axc5c711toc5 39800 axc5c711toc7 39801 axc5c711to11 39802 |
| Copyright terms: Public domain | W3C validator |