| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbv1h | GIF version | ||
| Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-May-2018.) |
| Ref | Expression |
|---|---|
| cbv1h.1 | ⊢ (𝜑 → (𝜓 → ∀𝑦𝜓)) |
| cbv1h.2 | ⊢ (𝜑 → (𝜒 → ∀𝑥𝜒)) |
| cbv1h.3 | ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒))) |
| Ref | Expression |
|---|---|
| cbv1h | ⊢ (∀𝑥∀𝑦𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfa1 1555 | . 2 ⊢ Ⅎ𝑥∀𝑥∀𝑦𝜑 | |
| 2 | nfa2 1593 | . 2 ⊢ Ⅎ𝑦∀𝑥∀𝑦𝜑 | |
| 3 | sp 1525 | . . . . 5 ⊢ (∀𝑦𝜑 → 𝜑) | |
| 4 | 3 | sps 1551 | . . . 4 ⊢ (∀𝑥∀𝑦𝜑 → 𝜑) |
| 5 | cbv1h.1 | . . . 4 ⊢ (𝜑 → (𝜓 → ∀𝑦𝜓)) | |
| 6 | 4, 5 | syl 14 | . . 3 ⊢ (∀𝑥∀𝑦𝜑 → (𝜓 → ∀𝑦𝜓)) |
| 7 | 2, 6 | nfd 1537 | . 2 ⊢ (∀𝑥∀𝑦𝜑 → Ⅎ𝑦𝜓) |
| 8 | cbv1h.2 | . . . 4 ⊢ (𝜑 → (𝜒 → ∀𝑥𝜒)) | |
| 9 | 4, 8 | syl 14 | . . 3 ⊢ (∀𝑥∀𝑦𝜑 → (𝜒 → ∀𝑥𝜒)) |
| 10 | 1, 9 | nfd 1537 | . 2 ⊢ (∀𝑥∀𝑦𝜑 → Ⅎ𝑥𝜒) |
| 11 | cbv1h.3 | . . 3 ⊢ (𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒))) | |
| 12 | 4, 11 | syl 14 | . 2 ⊢ (∀𝑥∀𝑦𝜑 → (𝑥 = 𝑦 → (𝜓 → 𝜒))) |
| 13 | 1, 2, 7, 10, 12 | cbv1 1759 | 1 ⊢ (∀𝑥∀𝑦𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∀wal 1362 |
| 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-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-i9 1544 ax-ial 1548 ax-i5r 1549 |
| This theorem depends on definitions: df-bi 117 df-nf 1475 |
| This theorem is referenced by: cbv2h 1762 |
| Copyright terms: Public domain | W3C validator |