| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sb3an | GIF version | ||
| Description: Conjunction inside and outside of a substitution are equivalent. (Contributed by NM, 14-Dec-2006.) |
| Ref | Expression |
|---|---|
| sb3an | ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓 ∧ [𝑦 / 𝑥]𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-3an 921 | . . 3 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ((𝜑 ∧ 𝜓) ∧ 𝜒)) | |
| 2 | 1 | sbbii 1688 | . 2 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝜓 ∧ 𝜒) ↔ [𝑦 / 𝑥]((𝜑 ∧ 𝜓) ∧ 𝜒)) |
| 3 | sban 1870 | . 2 ⊢ ([𝑦 / 𝑥]((𝜑 ∧ 𝜓) ∧ 𝜒) ↔ ([𝑦 / 𝑥](𝜑 ∧ 𝜓) ∧ [𝑦 / 𝑥]𝜒)) | |
| 4 | sban 1870 | . . . 4 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓)) | |
| 5 | 4 | anbi1i 445 | . . 3 ⊢ (([𝑦 / 𝑥](𝜑 ∧ 𝜓) ∧ [𝑦 / 𝑥]𝜒) ↔ (([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓) ∧ [𝑦 / 𝑥]𝜒)) |
| 6 | df-3an 921 | . . 3 ⊢ (([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓 ∧ [𝑦 / 𝑥]𝜒) ↔ (([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓) ∧ [𝑦 / 𝑥]𝜒)) | |
| 7 | 5, 6 | bitr4i 185 | . 2 ⊢ (([𝑦 / 𝑥](𝜑 ∧ 𝜓) ∧ [𝑦 / 𝑥]𝜒) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓 ∧ [𝑦 / 𝑥]𝜒)) |
| 8 | 2, 3, 7 | 3bitri 204 | 1 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝜓 ∧ 𝜒) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓 ∧ [𝑦 / 𝑥]𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 102 ↔ wb 103 ∧ w3a 919 [wsb 1685 |
| 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 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 |
| This theorem depends on definitions: df-bi 115 df-3an 921 df-nf 1390 df-sb 1686 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |