Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfwe | Structured version Visualization version Unicode version |
Description: Bound-variable hypothesis builder for well-orderings. (Contributed by Stefan O'Rear, 20-Jan-2015.) (Revised by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
nffr.r | |
nffr.a |
Ref | Expression |
---|---|
nfwe |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-we 5075 | . 2 | |
2 | nffr.r | . . . 4 | |
3 | nffr.a | . . . 4 | |
4 | 2, 3 | nffr 5088 | . . 3 |
5 | 2, 3 | nfso 5041 | . . 3 |
6 | 4, 5 | nfan 1828 | . 2 |
7 | 1, 6 | nfxfr 1779 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wa 384 wnf 1708 wnfc 2751 wor 5034 wfr 5070 wwe 5072 |
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-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 |
This theorem is referenced by: nfoi 8419 aomclem6 37629 |
Copyright terms: Public domain | W3C validator |