| 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 2920 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵) |
| 4 | 1, 3 | sylibr 237 | 1 ⊢ (𝜑 → Ⅎ𝑥𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 Ⅎwnfc 2908 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-nf 1817 df-cleq 2753 df-clel 2836 df-nfc 2910 |
| This theorem is used by: nfcsb1d 3869 nfcsbd 3872 nfcsbw 3873 nfifd 4512 nfunid 4873 nfopabd 5173 nfiotadw 6497 nfiotad 6499 nfriotadw 7385 nfriotad 7388 nfovd 7449 nfttrcld 9711 nfnegd 11552 nfchnd 18785 nfxnegd 46450 nfintd 50780 nfiund 50781 nfiundg 50782 |
| Copyright terms: Public domain | W3C validator |