| 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 6302 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
| 2 | nfpred.2 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
| 3 | nfpred.1 | . . . . 5 ⊢ Ⅎ𝑥𝑅 | |
| 4 | 3 | nfcnv 5864 | . . . 4 ⊢ Ⅎ𝑥◡𝑅 |
| 5 | nfpred.3 | . . . . 5 ⊢ Ⅎ𝑥𝑋 | |
| 6 | 5 | nfsn 4673 | . . . 4 ⊢ Ⅎ𝑥{𝑋} |
| 7 | 4, 6 | nfima 6070 | . . 3 ⊢ Ⅎ𝑥(◡𝑅 “ {𝑋}) |
| 8 | 2, 7 | nfin 4177 | . 2 ⊢ Ⅎ𝑥(𝐴 ∩ (◡𝑅 “ {𝑋})) |
| 9 | 1, 8 | nfcxfr 2923 | 1 ⊢ Ⅎ𝑥Pred(𝑅, 𝐴, 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: Ⅎwnfc 2910 ∩ cin 3904 {csn 4589 ◡ccnv 5660 “ cima 5664 Predcpred 6301 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-xp 5667 df-cnv 5669 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 |
| This theorem is referenced by: nffrecs 8276 nfwsuc 36308 nfwlim 36312 |
| Copyright terms: Public domain | W3C validator |