| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > nfsb4t | GIF version | ||
| Description: A variable not free remains so after substitution with a distinct variable (closed form of hbsb4 2031). (Contributed by NM, 7-Apr-2004.) (Revised by Mario Carneiro, 4-Oct-2016.) (Proof rewritten by Jim Kingdon, 9-May-2018.) | 
| Ref | Expression | 
|---|---|
| nfsb4t | ⊢ (∀𝑥Ⅎ𝑧𝜑 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | nfnf1 1558 | . . . . 5 ⊢ Ⅎ𝑧Ⅎ𝑧𝜑 | |
| 2 | 1 | nfal 1590 | . . . 4 ⊢ Ⅎ𝑧∀𝑥Ⅎ𝑧𝜑 | 
| 3 | nfnae 1736 | . . . 4 ⊢ Ⅎ𝑧 ¬ ∀𝑧 𝑧 = 𝑦 | |
| 4 | 2, 3 | nfan 1579 | . . 3 ⊢ Ⅎ𝑧(∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑧 𝑧 = 𝑦) | 
| 5 | df-nf 1475 | . . . . . 6 ⊢ (Ⅎ𝑧𝜑 ↔ ∀𝑧(𝜑 → ∀𝑧𝜑)) | |
| 6 | 5 | albii 1484 | . . . . 5 ⊢ (∀𝑥Ⅎ𝑧𝜑 ↔ ∀𝑥∀𝑧(𝜑 → ∀𝑧𝜑)) | 
| 7 | hbsb4t 2032 | . . . . 5 ⊢ (∀𝑥∀𝑧(𝜑 → ∀𝑧𝜑) → (¬ ∀𝑧 𝑧 = 𝑦 → ([𝑦 / 𝑥]𝜑 → ∀𝑧[𝑦 / 𝑥]𝜑))) | |
| 8 | 6, 7 | sylbi 121 | . . . 4 ⊢ (∀𝑥Ⅎ𝑧𝜑 → (¬ ∀𝑧 𝑧 = 𝑦 → ([𝑦 / 𝑥]𝜑 → ∀𝑧[𝑦 / 𝑥]𝜑))) | 
| 9 | 8 | imp 124 | . . 3 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → ([𝑦 / 𝑥]𝜑 → ∀𝑧[𝑦 / 𝑥]𝜑)) | 
| 10 | 4, 9 | nfd 1537 | . 2 ⊢ ((∀𝑥Ⅎ𝑧𝜑 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧[𝑦 / 𝑥]𝜑) | 
| 11 | 10 | ex 115 | 1 ⊢ (∀𝑥Ⅎ𝑧𝜑 → (¬ ∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)) | 
| Colors of variables: wff set class | 
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∀wal 1362 Ⅎwnf 1474 [wsb 1776 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 | 
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 | 
| This theorem is referenced by: dvelimdf 2035 | 
| Copyright terms: Public domain | W3C validator |