I have seen it said that MPC (Minimal Propositional Calculus) with LEM (Law of Excluded Middle; $A \lor \neg A$) is not equivalent to CPC (Classical Propositional Calculus), but I would like help finding a proof for this fact.
Notation
MPC means Minimal Propositional Calculus,
IPC means Intuitionistic Propositional Calculus,
CPC means Classical Propositional Calculus,
LEM means Law of Excluded Middle ($A \lor \neg A$),
DNE means Double Negation Elimination ($\neg \neg A \vdash A$),
EFQ means Ex Falso Quodlibet ($\bot \vdash A $).
Facts
I know that:
IPC = MPC + EFQ
CPC = MPC + DNE
CPC = IPC + LEM.
And so we see:
CPC = MPC + EFQ + LEM.
Goal
My goal is to show
CPC $\neq$ MPC + LEM.
Approach
This can be done by either showing that LEM does not imply EFQ:
$\neg A \lor A \not \vdash_{MPC} \bot \rightarrow B $,
equivalently,
$\not \models_{MPC} (\neg A \lor A) \rightarrow (\bot \rightarrow B)$
or that LEM does not imply DNE in MPC:
$\neg A \lor A \not \vdash_{MPC} \neg \neg B \rightarrow B $.
or equivalently
$\not \vdash_{MPC} (\neg A \lor A) \rightarrow (\neg \neg B \rightarrow B)$.
Difficulties
I am having trouble proving any of these. I am not sure how to prove that something is not a theorem; in CPC I would just use the contrapositive of completeness, but here that does seem to work; I would have thought to use some intermediate multi-valued Godel logic $G_n$ between CPC and IPC, but it seems like these statements are validities in $G_n$ for any $n$. Any advice for how to proceed would be appreciated.