Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nf5di | Structured version Visualization version Unicode version |
Description: Since the converse holds by a1i 11, this inference shows that we can represent a not-free hypothesis with either (inference form) or (deduction form). (Contributed by NM, 17-Aug-2018.) (Proof shortened by Wolf Lammen, 10-Jul-2019.) |
Ref | Expression |
---|---|
nf5di.1 |
Ref | Expression |
---|---|
nf5di |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nf5di.1 | . . . 4 | |
2 | 1 | nf5rd 2066 | . . 3 |
3 | 2 | pm2.43i 52 | . 2 |
4 | 3 | nf5i 2024 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wal 1481 wnf 1708 |
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-10 2019 ax-12 2047 |
This theorem depends on definitions: df-bi 197 df-ex 1705 df-nf 1710 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |