| Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > axc5c4c711 | Structured version Visualization version GIF version | ||
| Description: Proof of a theorem that can act as a sole axiom for pure predicate calculus with ax-gen 1822 as the inference rule. This proof extends the idea of axc5c711 39581 and related theorems. (Contributed by Andrew Salmon, 14-Jul-2011.) |
| Ref | Expression |
|---|---|
| axc5c4c711 | ⊢ ((∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓) → (𝜑 → ∀𝑦(∀𝑦𝜑 → 𝜓))) → (∀𝑦𝜑 → ∀𝑦𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axc4 2360 | . . 3 ⊢ (∀𝑦(∀𝑦𝜑 → 𝜓) → (∀𝑦𝜑 → ∀𝑦𝜓)) | |
| 2 | hbn1 2183 | . . . . 5 ⊢ (¬ ∀𝑦(∀𝑦𝜑 → 𝜓) → ∀𝑦 ¬ ∀𝑦(∀𝑦𝜑 → 𝜓)) | |
| 3 | axc7 2356 | . . . . . 6 ⊢ (¬ ∀𝑥 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓) → ∀𝑦(∀𝑦𝜑 → 𝜓)) | |
| 4 | 3 | con1i 148 | . . . . 5 ⊢ (¬ ∀𝑦(∀𝑦𝜑 → 𝜓) → ∀𝑥 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓)) |
| 5 | 2, 4 | alrimih 1851 | . . . 4 ⊢ (¬ ∀𝑦(∀𝑦𝜑 → 𝜓) → ∀𝑦∀𝑥 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓)) |
| 6 | ax-11 2198 | . . . 4 ⊢ (∀𝑦∀𝑥 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓) → ∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓)) | |
| 7 | 5, 6 | syl 18 | . . 3 ⊢ (¬ ∀𝑦(∀𝑦𝜑 → 𝜓) → ∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓)) |
| 8 | 1, 7 | nsyl4 159 | . 2 ⊢ (¬ ∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓) → (∀𝑦𝜑 → ∀𝑦𝜓)) |
| 9 | pm2.21 124 | . . . 4 ⊢ (¬ 𝜑 → (𝜑 → ∀𝑦𝜓)) | |
| 10 | 9 | spsd 2229 | . . 3 ⊢ (¬ 𝜑 → (∀𝑦𝜑 → ∀𝑦𝜓)) |
| 11 | 10, 1 | ja 188 | . 2 ⊢ ((𝜑 → ∀𝑦(∀𝑦𝜑 → 𝜓)) → (∀𝑦𝜑 → ∀𝑦𝜓)) |
| 12 | 8, 11 | ja 188 | 1 ⊢ ((∀𝑥∀𝑦 ¬ ∀𝑥∀𝑦(∀𝑦𝜑 → 𝜓) → (𝜑 → ∀𝑦(∀𝑦𝜑 → 𝜓))) → (∀𝑦𝜑 → ∀𝑦𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1565 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-10 2182 ax-11 2198 ax-12 2219 |
| This theorem depends on definitions: df-bi 210 df-ex 1807 |
| This theorem is referenced by: axc5c4c711toc5 45003 axc5c4c711toc4 45004 axc5c4c711toc7 45005 axc5c4c711to11 45006 |
| Copyright terms: Public domain | W3C validator |