Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nic-idbl | Structured version Visualization version GIF version |
Description: Double the terms. Since doubling is the same as negation, this can be viewed as a contraposition inference. (Contributed by Jeff Hoffman, 17-Nov-2007.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nic-idbl.1 | ⊢ (𝜑 ⊼ (𝜓 ⊼ 𝜓)) |
Ref | Expression |
---|---|
nic-idbl | ⊢ ((𝜓 ⊼ 𝜓) ⊼ ((𝜑 ⊼ 𝜑) ⊼ (𝜑 ⊼ 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nic-idbl.1 | . . 3 ⊢ (𝜑 ⊼ (𝜓 ⊼ 𝜓)) | |
2 | 1 | nic-imp 1683 | . 2 ⊢ ((𝜓 ⊼ 𝜓) ⊼ ((𝜑 ⊼ 𝜓) ⊼ (𝜑 ⊼ 𝜓))) |
3 | 1 | nic-imp 1683 | . 2 ⊢ ((𝜑 ⊼ 𝜓) ⊼ ((𝜑 ⊼ 𝜑) ⊼ (𝜑 ⊼ 𝜑))) |
4 | 2, 3 | nic-ich 1693 | 1 ⊢ ((𝜓 ⊼ 𝜓) ⊼ ((𝜑 ⊼ 𝜑) ⊼ (𝜑 ⊼ 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: ⊼ wnan 1487 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 210 df-an 400 df-nan 1488 |
This theorem is referenced by: nic-luk1 1699 |
Copyright terms: Public domain | W3C validator |