| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfcxfrd | Structured version Visualization version GIF version | ||
| Description: A utility lemma to transfer a bound-variable hypothesis builder into a definition. (Contributed by Mario Carneiro, 11-Aug-2016.) |
| Ref | Expression |
|---|---|
| nfcxfr.1 | ⊢ 𝐴 = 𝐵 |
| nfcxfrd.2 | ⊢ (𝜑 → Ⅎ𝑥𝐵) |
| Ref | Expression |
|---|---|
| nfcxfrd | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcxfrd.2 | . 2 ⊢ (𝜑 → Ⅎ𝑥𝐵) | |
| 2 | nfcxfr.1 | . . 3 ⊢ 𝐴 = 𝐵 | |
| 3 | 2 | nfceqi 2923 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵) |
| 4 | 1, 3 | sylibr 237 | 1 ⊢ (𝜑 → Ⅎ𝑥𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 Ⅎwnfc 2911 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-nf 1817 df-cleq 2755 df-clel 2839 df-nfc 2913 |
| This theorem is used by: nfcsb1d 3873 nfcsbd 3876 nfcsbw 3877 nfifd 4515 nfunid 4878 nfopabd 5179 nfiotadw 6523 nfiotad 6525 nfriotadw 7416 nfriotad 7419 nfovd 7480 nfttrcld 9748 nfnegd 11591 nfchnd 18835 nfxnegd 46785 nfintd 51248 nfiund 51249 nfiundg 51250 |
| Copyright terms: Public domain | W3C validator |