| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfcr | Structured version Visualization version GIF version | ||
| Description: Consequence of the not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.) Drop ax-12 2213 but use ax-8 2145, df-clel 2838, and avoid a DV condition on 𝑦, 𝐴. (Revised by SN, 3-Jun-2024.) |
| Ref | Expression |
|---|---|
| nfcr | ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nfc 2912 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴) | |
| 2 | eleq1w 2846 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 3 | 2 | nfbidv 1952 | . . 3 ⊢ (𝑧 = 𝑦 → (Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐴)) |
| 4 | 3 | spvv 2018 | . 2 ⊢ (∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| 5 | 1, 4 | sylbi 220 | 1 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1568 Ⅎwnf 1813 ∈ wcel 2143 Ⅎwnfc 2910 |
| 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 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1810 df-nf 1814 df-clel 2838 df-nfc 2912 |
| This theorem is referenced by: nfcri 2917 nfcrd 2919 abidnf 3665 csbtt 3870 csbnestgfw 4387 csbnestgf 4392 nfchnd 18662 |
| Copyright terms: Public domain | W3C validator |