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 6148 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
2 | nfpred.2 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
3 | nfpred.1 | . . . . 5 ⊢ Ⅎ𝑥𝑅 | |
4 | 3 | nfcnv 5749 | . . . 4 ⊢ Ⅎ𝑥◡𝑅 |
5 | nfpred.3 | . . . . 5 ⊢ Ⅎ𝑥𝑋 | |
6 | 5 | nfsn 4643 | . . . 4 ⊢ Ⅎ𝑥{𝑋} |
7 | 4, 6 | nfima 5937 | . . 3 ⊢ Ⅎ𝑥(◡𝑅 “ {𝑋}) |
8 | 2, 7 | nfin 4193 | . 2 ⊢ Ⅎ𝑥(𝐴 ∩ (◡𝑅 “ {𝑋})) |
9 | 1, 8 | nfcxfr 2975 | 1 ⊢ Ⅎ𝑥Pred(𝑅, 𝐴, 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnfc 2961 ∩ cin 3935 {csn 4567 ◡ccnv 5554 “ cima 5558 Predcpred 6147 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-xp 5561 df-cnv 5563 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 |
This theorem is referenced by: nfwrecs 7949 nfwsuc 33105 nfwlim 33109 nffrecs 33120 |
Copyright terms: Public domain | W3C validator |