| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfald2 | Structured version Visualization version GIF version | ||
| Description: Variation on nfald 2339 which adds the hypothesis that 𝑥 and 𝑦 are distinct in the inner subproof. (Contributed by Mario Carneiro, 8-Oct-2016.) Usage of this theorem is discouraged because it depends on ax-13 2382. Use nfald 2339 instead. (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nfald2.1 | ⊢ Ⅎ𝑦𝜑 |
| nfald2.2 | ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓) |
| Ref | Expression |
|---|---|
| nfald2 | ⊢ (𝜑 → Ⅎ𝑥∀𝑦𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfald2.1 | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
| 2 | nfnae 2444 | . . . . 5 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦 | |
| 3 | 1, 2 | nfan 1907 | . . . 4 ⊢ Ⅎ𝑦(𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) |
| 4 | nfald2.2 | . . . 4 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓) | |
| 5 | 3, 4 | nfald 2339 | . . 3 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥∀𝑦𝜓) |
| 6 | 5 | ex 414 | . 2 ⊢ (𝜑 → (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥∀𝑦𝜓)) |
| 7 | nfa1 2164 | . . 3 ⊢ Ⅎ𝑦∀𝑦𝜓 | |
| 8 | biidd 264 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜓 ↔ ∀𝑦𝜓)) | |
| 9 | 8 | drnf1 2453 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥∀𝑦𝜓 ↔ Ⅎ𝑦∀𝑦𝜓)) |
| 10 | 7, 9 | mpbiri 260 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥∀𝑦𝜓) |
| 11 | 6, 10 | pm2.61d2 182 | 1 ⊢ (𝜑 → Ⅎ𝑥∀𝑦𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∀wal 1546 Ⅎwnf 1791 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-10 2154 ax-11 2170 ax-12 2191 ax-13 2382 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-tru 1551 df-ex 1788 df-nf 1792 |
| This theorem is referenced by: nfexd2 2456 dvelimf 2458 nfmod2 2564 nfrald 3338 nfiotad 6449 nfixp 8859 |
| Copyright terms: Public domain | W3C validator |