| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > bianfd | Structured version Visualization version GIF version | ||
| Description: A wff conjoined with falsehood is false. (Contributed by NM, 27-Mar-1995.) (Proof shortened by Wolf Lammen, 5-Nov-2013.) |
| Ref | Expression |
|---|---|
| bianfd.1 | ⊢ (𝜑 → ¬ 𝜓) |
| Ref | Expression |
|---|---|
| bianfd | ⊢ (𝜑 → (𝜓 ↔ (𝜓 ∧ 𝜒))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bianfd.1 | . 2 ⊢ (𝜑 → ¬ 𝜓) | |
| 2 | 1 | intnanrd 489 | . 2 ⊢ (𝜑 → ¬ (𝜓 ∧ 𝜒)) |
| 3 | 1, 2 | 2falsed 376 | 1 ⊢ (𝜑 → (𝜓 ↔ (𝜓 ∧ 𝜒))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 |
| 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 207 df-an 396 |
| This theorem is referenced by: eueq2 3716 eueq3 3717 axsepg2 35096 axsepg2ALT 35097 |
| Copyright terms: Public domain | W3C validator |