![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nfwe | Structured version Visualization version GIF 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 | ⊢ Ⅎ𝑥 𝑅 We 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-we 5633 | . 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴)) | |
2 | nffr.r | . . . 4 ⊢ Ⅎ𝑥𝑅 | |
3 | nffr.a | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
4 | 2, 3 | nffr 5650 | . . 3 ⊢ Ⅎ𝑥 𝑅 Fr 𝐴 |
5 | 2, 3 | nfso 5594 | . . 3 ⊢ Ⅎ𝑥 𝑅 Or 𝐴 |
6 | 4, 5 | nfan 1902 | . 2 ⊢ Ⅎ𝑥(𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) |
7 | 1, 6 | nfxfr 1855 | 1 ⊢ Ⅎ𝑥 𝑅 We 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 Ⅎwnf 1785 Ⅎwnfc 2883 Or wor 5587 Fr wfr 5628 We wwe 5630 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 |
This theorem is referenced by: nfoi 9511 aomclem6 41889 |
Copyright terms: Public domain | W3C validator |