| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfsb4 | 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 (inference associated with nfsb4t 2502). Theorem nfsb 2526 replaces the distinctor antecedent with a disjoint variable condition. See nfsbv 2329 for a weaker version of nfsb 2526 not requiring ax-13 2375. (Contributed by NM, 14-May-1993.) (Revised by Mario Carneiro, 4-Oct-2016.) Usage of this theorem is discouraged because it depends on ax-13 2375. Use nfsbv 2329 instead. (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nfsb4.1 | ⊢ Ⅎ𝑧𝜑 |
| Ref | Expression |
|---|---|
| nfsb4 | ⊢ (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfsb4t 2502 | . 2 ⊢ (∀𝑥Ⅎ𝑧𝜑 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) | |
| 2 | nfsb4.1 | . 2 ⊢ Ⅎ𝑧𝜑 | |
| 3 | 1, 2 | mpg 1796 | 1 ⊢ (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1537 Ⅎwnf 1782 [wsb 2063 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-10 2140 ax-11 2156 ax-12 2176 ax-13 2375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1542 df-ex 1779 df-nf 1783 df-sb 2064 |
| This theorem is referenced by: sbco2 2514 |
| Copyright terms: Public domain | W3C validator |