| 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 6288 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
| 2 | nfpred.2 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
| 3 | nfpred.1 | . . . . 5 ⊢ Ⅎ𝑥𝑅 | |
| 4 | 3 | nfcnv 5850 | . . . 4 ⊢ Ⅎ𝑥◡𝑅 |
| 5 | nfpred.3 | . . . . 5 ⊢ Ⅎ𝑥𝑋 | |
| 6 | 5 | nfsn 4666 | . . . 4 ⊢ Ⅎ𝑥{𝑋} |
| 7 | 4, 6 | nfima 6057 | . . 3 ⊢ Ⅎ𝑥(◡𝑅 “ {𝑋}) |
| 8 | 2, 7 | nfin 4176 | . 2 ⊢ Ⅎ𝑥(𝐴 ∩ (◡𝑅 “ {𝑋})) |
| 9 | 1, 8 | nfcxfr 2922 | 1 ⊢ Ⅎ𝑥Pred(𝑅, 𝐴, 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: Ⅎwnfc 2909 ∩ cin 3903 {csn 4582 ◡ccnv 5646 “ cima 5650 Predcpred 6287 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5653 df-cnv 5655 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 |
| This theorem is referenced by: nffrecs 8264 nfwsuc 36166 nfwlim 36170 |
| Copyright terms: Public domain | W3C validator |