![]() |
New Foundations Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > NFE Home > Th. List > mpgbi | Unicode version |
Description: Modus ponens on biconditional combined with generalization. (Contributed by NM, 24-May-1994.) (Proof shortened by Stefan Allan, 28-Oct-2008.) |
Ref | Expression |
---|---|
mpgbi.1 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
mpgbi.2 |
![]() ![]() |
Ref | Expression |
---|---|
mpgbi |
![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mpgbi.2 |
. . 3
![]() ![]() | |
2 | 1 | ax-gen 1546 |
. 2
![]() ![]() ![]() ![]() |
3 | mpgbi.1 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 2, 3 | mpbi 199 |
1
![]() ![]() |
Colors of variables: wff setvar class |
Syntax hints: ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 |
This theorem depends on definitions: df-bi 177 |
This theorem is referenced by: nex 1555 exlimi 1803 exlimihOLD 1805 exan 1882 abbii 2466 |
Copyright terms: Public domain | W3C validator |