| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Rearrangement of 4 disjuncts. |
| Ref | Expression |
|---|---|
| or42 | ⊢ (((φ ∨ ψ) ∨ (χ ∨ θ)) ↔ ((φ ∨ χ) ∨ (θ ∨ ψ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | or4 220 | . 2 ⊢ (((φ ∨ ψ) ∨ (χ ∨ θ)) ↔ ((φ ∨ χ) ∨ (ψ ∨ θ))) | |
| 2 | orcom 209 | . . 3 ⊢ ((ψ ∨ θ) ↔ (θ ∨ ψ)) | |
| 3 | 2 | orbi2i 214 | . 2 ⊢ (((φ ∨ χ) ∨ (ψ ∨ θ)) ↔ ((φ ∨ χ) ∨ (θ ∨ ψ))) |
| 4 | 1, 3 | bitr 151 | 1 ⊢ (((φ ∨ ψ) ∨ (χ ∨ θ)) ↔ ((φ ∨ χ) ∨ (θ ∨ ψ))) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 127 ∨ wo 195 |
| This theorem is referenced by: biass 511 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |
| This theorem depends on definitions: df-bi 128 df-or 197 |