| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfsb4t | Structured version Visualization version GIF version | ||
| Description: A variable not free in a proposition remains so after substitution in that proposition with a distinct variable (closed form of nfsb4 2535). Usage of this theorem is discouraged because it depends on ax-13 2407. (Contributed by NM, 7-Apr-2004.) (Revised by Mario Carneiro, 4-Oct-2016.) (Proof shortened by Wolf Lammen, 11-May-2018.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nfsb4t | ⊢ (∀𝑥Ⅎ𝑧𝜑 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ12 2290 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑)) | |
| 2 | 1 | sps 2224 | . . . . . . 7 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑)) |
| 3 | 2 | drnf2 2479 | . . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝜑 ↔ Ⅎ𝑧[𝑦 / 𝑥]𝜑)) |
| 4 | 3 | biimpd 232 | . . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) |
| 5 | 4 | spsd 2226 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) |
| 6 | 5 | impcom 413 | . . 3 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑧[𝑦 / 𝑥]𝜑) |
| 7 | 6 | a1d 26 | . 2 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ∀𝑥 𝑥 = 𝑦) → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) |
| 8 | nfnf1 2192 | . . . . 5 ⊢ Ⅎ𝑧Ⅎ𝑧𝜑 | |
| 9 | 8 | nfal 2359 | . . . 4 ⊢ Ⅎ𝑧∀𝑥Ⅎ𝑧𝜑 |
| 10 | nfnae 2469 | . . . 4 ⊢ Ⅎ𝑧 ¬ ∀𝑥 𝑥 = 𝑦 | |
| 11 | 9, 10 | nfan 1932 | . . 3 ⊢ Ⅎ𝑧(∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) |
| 12 | nfa1 2189 | . . . 4 ⊢ Ⅎ𝑥∀𝑥Ⅎ𝑧𝜑 | |
| 13 | nfnae 2469 | . . . 4 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦 | |
| 14 | 12, 13 | nfan 1932 | . . 3 ⊢ Ⅎ𝑥(∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) |
| 15 | sp 2222 | . . . 4 ⊢ (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧𝜑) | |
| 16 | 15 | adantr 486 | . . 3 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑧𝜑) |
| 17 | nfsb2 2518 | . . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥[𝑦 / 𝑥]𝜑) | |
| 18 | 17 | adantl 487 | . . 3 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥[𝑦 / 𝑥]𝜑) |
| 19 | 1 | a1i 11 | . . 3 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))) |
| 20 | 11, 14, 16, 18, 19 | dvelimdf 2484 | . 2 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) |
| 21 | 7, 20 | pm2.61dan 825 | 1 ⊢ (∀𝑥Ⅎ𝑧𝜑 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 Ⅎwnf 1816 [wsb 2099 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-10 2179 ax-11 2195 ax-12 2216 ax-13 2407 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 |
| This theorem is used by: nfsb4 2535 nfsbd 2557 |
| Copyright terms: Public domain | W3C validator |