Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 3bitrri | GIF version |
Description: A chained inference from transitive law for logical equivalence. (Contributed by NM, 4-Aug-2006.) |
Ref | Expression |
---|---|
3bitri.1 | ⊢ (𝜑 ↔ 𝜓) |
3bitri.2 | ⊢ (𝜓 ↔ 𝜒) |
3bitri.3 | ⊢ (𝜒 ↔ 𝜃) |
Ref | Expression |
---|---|
3bitrri | ⊢ (𝜃 ↔ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3bitri.3 | . 2 ⊢ (𝜒 ↔ 𝜃) | |
2 | 3bitri.1 | . . 3 ⊢ (𝜑 ↔ 𝜓) | |
3 | 3bitri.2 | . . 3 ⊢ (𝜓 ↔ 𝜒) | |
4 | 2, 3 | bitr2i 174 | . 2 ⊢ (𝜒 ↔ 𝜑) |
5 | 1, 4 | bitr3i 175 | 1 ⊢ (𝜃 ↔ 𝜑) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 98 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 |
This theorem depends on definitions: df-bi 110 |
This theorem is referenced by: reu8 2737 unass 3100 ssin 3159 difab 3206 iunss 3698 poirr 4044 cnvuni 4521 dfco2 4820 dff1o6 5416 elznn0 8260 bj-ssom 10060 |
Copyright terms: Public domain | W3C validator |