| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 3orbi123d | GIF version | ||
| Description: Deduction joining 3 equivalences to form equivalence of disjunctions. (Contributed by NM, 20-Apr-1994.) |
| Ref | Expression |
|---|---|
| bi3d.1 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
| bi3d.2 | ⊢ (𝜑 → (𝜃 ↔ 𝜏)) |
| bi3d.3 | ⊢ (𝜑 → (𝜂 ↔ 𝜁)) |
| Ref | Expression |
|---|---|
| 3orbi123d | ⊢ (𝜑 → ((𝜓 ∨ 𝜃 ∨ 𝜂) ↔ (𝜒 ∨ 𝜏 ∨ 𝜁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bi3d.1 | . . . 4 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
| 2 | bi3d.2 | . . . 4 ⊢ (𝜑 → (𝜃 ↔ 𝜏)) | |
| 3 | 1, 2 | orbi12d 739 | . . 3 ⊢ (𝜑 → ((𝜓 ∨ 𝜃) ↔ (𝜒 ∨ 𝜏))) |
| 4 | bi3d.3 | . . 3 ⊢ (𝜑 → (𝜂 ↔ 𝜁)) | |
| 5 | 3, 4 | orbi12d 739 | . 2 ⊢ (𝜑 → (((𝜓 ∨ 𝜃) ∨ 𝜂) ↔ ((𝜒 ∨ 𝜏) ∨ 𝜁))) |
| 6 | df-3or 920 | . 2 ⊢ ((𝜓 ∨ 𝜃 ∨ 𝜂) ↔ ((𝜓 ∨ 𝜃) ∨ 𝜂)) | |
| 7 | df-3or 920 | . 2 ⊢ ((𝜒 ∨ 𝜏 ∨ 𝜁) ↔ ((𝜒 ∨ 𝜏) ∨ 𝜁)) | |
| 8 | 5, 6, 7 | 3bitr4g 221 | 1 ⊢ (𝜑 → ((𝜓 ∨ 𝜃 ∨ 𝜂) ↔ (𝜒 ∨ 𝜏 ∨ 𝜁))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 103 ∨ wo 661 ∨ w3o 918 |
| 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 |
| This theorem depends on definitions: df-bi 115 df-3or 920 |
| This theorem is referenced by: ordtriexmid 4265 wetriext 4319 nntri3or 6095 ltsopi 6510 pitri3or 6512 nqtri3or 6586 elz 8353 ztri3or 8394 qtri3or 9252 |
| Copyright terms: Public domain | W3C validator |