Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfpred | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for the predecessor class. (Contributed by Scott Fenton, 9-Jun-2018.) |
Ref | Expression |
---|---|
nfpred.1 | ⊢ Ⅎ𝑥𝑅 |
nfpred.2 | ⊢ Ⅎ𝑥𝐴 |
nfpred.3 | ⊢ Ⅎ𝑥𝑋 |
Ref | Expression |
---|---|
nfpred | ⊢ Ⅎ𝑥Pred(𝑅, 𝐴, 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pred 6191 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
2 | nfpred.2 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
3 | nfpred.1 | . . . . 5 ⊢ Ⅎ𝑥𝑅 | |
4 | 3 | nfcnv 5776 | . . . 4 ⊢ Ⅎ𝑥◡𝑅 |
5 | nfpred.3 | . . . . 5 ⊢ Ⅎ𝑥𝑋 | |
6 | 5 | nfsn 4640 | . . . 4 ⊢ Ⅎ𝑥{𝑋} |
7 | 4, 6 | nfima 5966 | . . 3 ⊢ Ⅎ𝑥(◡𝑅 “ {𝑋}) |
8 | 2, 7 | nfin 4147 | . 2 ⊢ Ⅎ𝑥(𝐴 ∩ (◡𝑅 “ {𝑋})) |
9 | 1, 8 | nfcxfr 2904 | 1 ⊢ Ⅎ𝑥Pred(𝑅, 𝐴, 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnfc 2886 ∩ cin 3882 {csn 4558 ◡ccnv 5579 “ cima 5583 Predcpred 6190 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-xp 5586 df-cnv 5588 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 |
This theorem is referenced by: nffrecs 8070 nfwrecsOLD 8104 nfwsuc 33739 nfwlim 33743 |
Copyright terms: Public domain | W3C validator |