| 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 6775 nntri2or2 6776 nntr2 6781 tridc 7210 nnnninfeq 7475 exmidontriimlem2 7585 caucvgprlemnkj 8040 caucvgprlemnbj 8041 caucvgprprlemnkj 8066 caucvgprprlemnbj 8067 caucvgsr 8176 npnflt 10234 nmnfgt 10237 xleadd1a 10292 xltadd1 10295 xlt2add 10299 xsubge0 10300 xleaddadd 10306 addmodlteq 10856 iseqf1olemkle 10955 hashfiv01gt1 11243 iswrdiz 11333 xrmaxltsup 12049 xrmaxadd 12052 xrbdtri 12067 cvgratz 12324 zdvdsdc 12604 divalglemeunn 12713 divalglemex 12714 divalglemeuneg 12715 divalg 12716 znege1 12983 ennnfonelemk 13349 isxmet2d 15607 trilpolemres 17331 trirec0 17333 |
| Copyright terms: Public domain | W3C validator |