Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sb6x | GIF version |
Description: Equivalence involving substitution for a variable not free. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) |
Ref | Expression |
---|---|
sb6x.1 | ⊢ (𝜑 → ∀𝑥𝜑) |
Ref | Expression |
---|---|
sb6x | ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sb6x.1 | . . 3 ⊢ (𝜑 → ∀𝑥𝜑) | |
2 | 1 | sbh 1769 | . 2 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜑) |
3 | biidd 171 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜑)) | |
4 | 1, 3 | equsalh 1719 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜑) |
5 | 2, 4 | bitr4i 186 | 1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∀wal 1346 [wsb 1755 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1440 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-4 1503 ax-i9 1523 ax-ial 1527 |
This theorem depends on definitions: df-bi 116 df-sb 1756 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |