| 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 4726 nntri3 6774 nntri2or2 6775 nntr2 6780 tridc 7209 nnnninfeq 7475 exmidontriimlem2 7585 caucvgprlemnkj 8040 caucvgprlemnbj 8041 caucvgprprlemnkj 8066 caucvgprprlemnbj 8067 caucvgsr 8176 npnflt 10235 nmnfgt 10238 xleadd1a 10293 xltadd1 10296 xlt2add 10300 xsubge0 10301 xleaddadd 10307 addmodlteq 10857 iseqf1olemkle 10956 hashfiv01gt1 11244 iswrdiz 11334 xrmaxltsup 12050 xrmaxadd 12053 xrbdtri 12068 cvgratz 12325 zdvdsdc 12605 divalglemeunn 12714 divalglemex 12715 divalglemeuneg 12716 divalg 12717 znege1 12984 ennnfonelemk 13350 isxmet2d 15586 trilpolemres 17310 trirec0 17312 |
| Copyright terms: Public domain | W3C validator |