| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbcom2v2 | GIF version | ||
| Description: Lemma for proving sbcom2 2018. It is the same as sbcom2v 2016 but removes the distinct variable constraint on 𝑥 and 𝑦. (Contributed by Jim Kingdon, 19-Feb-2018.) |
| Ref | Expression |
|---|---|
| sbcom2v2 | ⊢ ([𝑤 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbcom2v 2016 | . . 3 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑤 / 𝑧][𝑣 / 𝑥]𝜑) | |
| 2 | sbcom2v 2016 | . . . 4 ⊢ ([𝑤 / 𝑧][𝑣 / 𝑥]𝜑 ↔ [𝑣 / 𝑥][𝑤 / 𝑧]𝜑) | |
| 3 | 2 | sbbii 1791 | . . 3 ⊢ ([𝑦 / 𝑣][𝑤 / 𝑧][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑) |
| 4 | 1, 3 | bitri 184 | . 2 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑) |
| 5 | ax-17 1552 | . . . 4 ⊢ (𝜑 → ∀𝑣𝜑) | |
| 6 | 5 | sbco2vh 1976 | . . 3 ⊢ ([𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) |
| 7 | 6 | sbbii 1791 | . 2 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑤 / 𝑧][𝑦 / 𝑥]𝜑) |
| 8 | ax-17 1552 | . . 3 ⊢ ([𝑤 / 𝑧]𝜑 → ∀𝑣[𝑤 / 𝑧]𝜑) | |
| 9 | 8 | sbco2vh 1976 | . 2 ⊢ ([𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑) |
| 10 | 4, 7, 9 | 3bitr3i 210 | 1 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 [wsb 1788 |
| 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-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 |
| This theorem depends on definitions: df-bi 117 df-nf 1487 df-sb 1789 |
| This theorem is referenced by: sbcom2 2018 |
| Copyright terms: Public domain | W3C validator |