Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sbbi | GIF version |
Description: Equivalence inside and outside of a substitution are equivalent. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
sbbi | ⊢ ([𝑦 / 𝑥](𝜑 ↔ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfbi2 386 | . . 3 ⊢ ((𝜑 ↔ 𝜓) ↔ ((𝜑 → 𝜓) ∧ (𝜓 → 𝜑))) | |
2 | 1 | sbbii 1753 | . 2 ⊢ ([𝑦 / 𝑥](𝜑 ↔ 𝜓) ↔ [𝑦 / 𝑥]((𝜑 → 𝜓) ∧ (𝜓 → 𝜑))) |
3 | sbim 1941 | . . . 4 ⊢ ([𝑦 / 𝑥](𝜑 → 𝜓) ↔ ([𝑦 / 𝑥]𝜑 → [𝑦 / 𝑥]𝜓)) | |
4 | sbim 1941 | . . . 4 ⊢ ([𝑦 / 𝑥](𝜓 → 𝜑) ↔ ([𝑦 / 𝑥]𝜓 → [𝑦 / 𝑥]𝜑)) | |
5 | 3, 4 | anbi12i 456 | . . 3 ⊢ (([𝑦 / 𝑥](𝜑 → 𝜓) ∧ [𝑦 / 𝑥](𝜓 → 𝜑)) ↔ (([𝑦 / 𝑥]𝜑 → [𝑦 / 𝑥]𝜓) ∧ ([𝑦 / 𝑥]𝜓 → [𝑦 / 𝑥]𝜑))) |
6 | sban 1943 | . . 3 ⊢ ([𝑦 / 𝑥]((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) ↔ ([𝑦 / 𝑥](𝜑 → 𝜓) ∧ [𝑦 / 𝑥](𝜓 → 𝜑))) | |
7 | dfbi2 386 | . . 3 ⊢ (([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜓) ↔ (([𝑦 / 𝑥]𝜑 → [𝑦 / 𝑥]𝜓) ∧ ([𝑦 / 𝑥]𝜓 → [𝑦 / 𝑥]𝜑))) | |
8 | 5, 6, 7 | 3bitr4i 211 | . 2 ⊢ ([𝑦 / 𝑥]((𝜑 → 𝜓) ∧ (𝜓 → 𝜑)) ↔ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜓)) |
9 | 2, 8 | bitri 183 | 1 ⊢ ([𝑦 / 𝑥](𝜑 ↔ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 [wsb 1750 |
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-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 |
This theorem depends on definitions: df-bi 116 df-nf 1449 df-sb 1751 |
This theorem is referenced by: sblbis 1948 sbrbis 1949 sbco 1956 sbcocom 1958 sb8eu 2027 sb8euh 2037 elsb1 2143 elsb2 2144 pm13.183 2864 sbcbig 2997 sb8iota 5160 |
Copyright terms: Public domain | W3C validator |