Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > spimv | GIF version |
Description: A version of spim 1666 with a distinct variable requirement instead of a bound variable hypothesis. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
spimv.1 | ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) |
Ref | Expression |
---|---|
spimv | ⊢ (∀𝑥𝜑 → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1461 | . 2 ⊢ Ⅎ𝑥𝜓 | |
2 | spimv.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) | |
3 | 1, 2 | spim 1666 | 1 ⊢ (∀𝑥𝜑 → 𝜓) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1282 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 |
This theorem depends on definitions: df-bi 115 df-nf 1390 |
This theorem is referenced by: aev 1733 ax16i 1779 spv 1781 reu6 2781 el 3952 |
Copyright terms: Public domain | W3C validator |