Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > eliminable2c | Structured version Visualization version Unicode version |
Description: A theorem used to prove the base case of the Eliminability Theorem (see section comment). (Contributed by BJ, 19-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
eliminable2c |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfcleq 2616 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wb 196 wal 1481 wceq 1483 wcel 1990 cab 2608 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-cleq 2615 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |