Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfcd | Structured version Visualization version GIF version |
Description: Deduce that a class 𝐴 does not have 𝑥 free in it. (Contributed by Mario Carneiro, 11-Aug-2016.) |
Ref | Expression |
---|---|
nfcd.1 | ⊢ Ⅎ𝑦𝜑 |
nfcd.2 | ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
Ref | Expression |
---|---|
nfcd | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcd.1 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
2 | nfcd.2 | . . 3 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴) | |
3 | 1, 2 | alrimi 2209 | . 2 ⊢ (𝜑 → ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) |
4 | df-nfc 2963 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) | |
5 | 3, 4 | sylibr 236 | 1 ⊢ (𝜑 → Ⅎ𝑥𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1531 Ⅎwnf 1780 ∈ wcel 2110 Ⅎwnfc 2961 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-12 2173 |
This theorem depends on definitions: df-bi 209 df-ex 1777 df-nf 1781 df-nfc 2963 |
This theorem is referenced by: nfabdw 3000 nfabd 3001 nfabd2OLD 3003 dvelimdc 3005 nfcvf 3007 sbnfc2 4387 |
Copyright terms: Public domain | W3C validator |