| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dedth4v | Structured version Visualization version GIF version | ||
| Description: Weak deduction theorem for eliminating a hypothesis with 4 class variables. See comments in dedth2v 4568. (Contributed by NM, 21-Apr-2007.) (Proof shortened by Eric Schmidt, 28-Jul-2009.) |
| Ref | Expression |
|---|---|
| dedth4v.1 | ⊢ (𝐴 = if(𝜑, 𝐴, 𝑅) → (𝜓 ↔ 𝜒)) |
| dedth4v.2 | ⊢ (𝐵 = if(𝜑, 𝐵, 𝑆) → (𝜒 ↔ 𝜃)) |
| dedth4v.3 | ⊢ (𝐶 = if(𝜑, 𝐶, 𝑇) → (𝜃 ↔ 𝜏)) |
| dedth4v.4 | ⊢ (𝐷 = if(𝜑, 𝐷, 𝑈) → (𝜏 ↔ 𝜂)) |
| dedth4v.5 | ⊢ 𝜂 |
| Ref | Expression |
|---|---|
| dedth4v | ⊢ (𝜑 → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dedth4v.1 | . . . 4 ⊢ (𝐴 = if(𝜑, 𝐴, 𝑅) → (𝜓 ↔ 𝜒)) | |
| 2 | dedth4v.2 | . . . 4 ⊢ (𝐵 = if(𝜑, 𝐵, 𝑆) → (𝜒 ↔ 𝜃)) | |
| 3 | dedth4v.3 | . . . 4 ⊢ (𝐶 = if(𝜑, 𝐶, 𝑇) → (𝜃 ↔ 𝜏)) | |
| 4 | dedth4v.4 | . . . 4 ⊢ (𝐷 = if(𝜑, 𝐷, 𝑈) → (𝜏 ↔ 𝜂)) | |
| 5 | dedth4v.5 | . . . 4 ⊢ 𝜂 | |
| 6 | 1, 2, 3, 4, 5 | dedth4h 4567 | . . 3 ⊢ (((𝜑 ∧ 𝜑) ∧ (𝜑 ∧ 𝜑)) → 𝜓) |
| 7 | 6 | anidms 566 | . 2 ⊢ ((𝜑 ∧ 𝜑) → 𝜓) |
| 8 | 7 | anidms 566 | 1 ⊢ (𝜑 → 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ifcif 4505 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-if 4506 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |