| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpjao3dan | GIF version | ||
| Description: Eliminate a 3-way disjunction in a deduction. (Contributed by Thierry Arnoux, 13-Apr-2018.) |
| Ref | Expression |
|---|---|
| mpjao3dan.1 | ⊢ ((𝜑 ∧ 𝜓) → 𝜒) |
| mpjao3dan.2 | ⊢ ((𝜑 ∧ 𝜃) → 𝜒) |
| mpjao3dan.3 | ⊢ ((𝜑 ∧ 𝜏) → 𝜒) |
| mpjao3dan.4 | ⊢ (𝜑 → (𝜓 ∨ 𝜃 ∨ 𝜏)) |
| Ref | Expression |
|---|---|
| mpjao3dan | ⊢ (𝜑 → 𝜒) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpjao3dan.1 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝜒) | |
| 2 | mpjao3dan.2 | . . 3 ⊢ ((𝜑 ∧ 𝜃) → 𝜒) | |
| 3 | 1, 2 | jaodan 809 | . 2 ⊢ ((𝜑 ∧ (𝜓 ∨ 𝜃)) → 𝜒) |
| 4 | mpjao3dan.3 | . 2 ⊢ ((𝜑 ∧ 𝜏) → 𝜒) | |
| 5 | mpjao3dan.4 | . . 3 ⊢ (𝜑 → (𝜓 ∨ 𝜃 ∨ 𝜏)) | |
| 6 | df-3or 1010 | . . 3 ⊢ ((𝜓 ∨ 𝜃 ∨ 𝜏) ↔ ((𝜓 ∨ 𝜃) ∨ 𝜏)) | |
| 7 | 5, 6 | sylib 122 | . 2 ⊢ (𝜑 → ((𝜓 ∨ 𝜃) ∨ 𝜏)) |
| 8 | 3, 4, 7 | mpjaodan 810 | 1 ⊢ (𝜑 → 𝜒) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∨ wo 720 ∨ w3o 1008 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 |
| This proof depends on definitions: df-bi 117 df-3or 1010 |
| This theorem is used by: wetriext 4724 nntri3 6770 nntri2or2 6771 nntr2 6776 tridc 7204 nnnninfeq 7469 exmidontriimlem2 7579 caucvgprlemnkj 8034 caucvgprlemnbj 8035 caucvgprprlemnkj 8060 caucvgprprlemnbj 8061 caucvgsr 8170 npnflt 10228 nmnfgt 10231 xleadd1a 10286 xltadd1 10289 xlt2add 10293 xsubge0 10294 xleaddadd 10300 addmodlteq 10849 iseqf1olemkle 10948 hashfiv01gt1 11236 iswrdiz 11326 xrmaxltsup 12042 xrmaxadd 12045 xrbdtri 12060 cvgratz 12317 zdvdsdc 12597 divalglemeunn 12706 divalglemex 12707 divalglemeuneg 12708 divalg 12709 znege1 12976 ennnfonelemk 13342 isxmet2d 15501 trilpolemres 17213 trirec0 17215 |
| Copyright terms: Public domain | W3C validator |