| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nrexralim | Structured version Visualization version Unicode version | ||
| Description: Negation of a complex predicate calculus formula. (Contributed by FL, 31-Jul-2009.) |
| Ref | Expression |
|---|---|
| nrexralim |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexanali 2998 |
. . 3
| |
| 2 | 1 | ralbii 2980 |
. 2
|
| 3 | ralnex 2992 |
. 2
| |
| 4 | 2, 3 | bitr2i 265 |
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 1722 ax-4 1737 |
| This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-ral 2917 df-rex 2918 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |