![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > sbcom2v2 | GIF version |
Description: Lemma for proving sbcom2 1906. It is the same as sbcom2v 1904 but removes the distinct variable constraint on 𝑥 and 𝑦. (Contributed by Jim Kingdon, 19-Feb-2018.) |
Ref | Expression |
---|---|
sbcom2v2 | ⊢ ([𝑤 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcom2v 1904 | . . 3 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑤 / 𝑧][𝑣 / 𝑥]𝜑) | |
2 | sbcom2v 1904 | . . . 4 ⊢ ([𝑤 / 𝑧][𝑣 / 𝑥]𝜑 ↔ [𝑣 / 𝑥][𝑤 / 𝑧]𝜑) | |
3 | 2 | sbbii 1690 | . . 3 ⊢ ([𝑦 / 𝑣][𝑤 / 𝑧][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑) |
4 | 1, 3 | bitri 182 | . 2 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑) |
5 | ax-17 1460 | . . . 4 ⊢ (𝜑 → ∀𝑣𝜑) | |
6 | 5 | sbco2v 1864 | . . 3 ⊢ ([𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
7 | 6 | sbbii 1690 | . 2 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑤 / 𝑧][𝑦 / 𝑥]𝜑) |
8 | ax-17 1460 | . . 3 ⊢ ([𝑤 / 𝑧]𝜑 → ∀𝑣[𝑤 / 𝑧]𝜑) | |
9 | 8 | sbco2v 1864 | . 2 ⊢ ([𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑) |
10 | 4, 7, 9 | 3bitr3i 208 | 1 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 103 [wsb 1687 |
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-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-4 1441 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 |
This theorem depends on definitions: df-bi 115 df-nf 1391 df-sb 1688 |
This theorem is referenced by: sbcom2 1906 |
Copyright terms: Public domain | W3C validator |