| 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 2180 but use ax-8 2113, df-clel 2806, and avoid a DV condition on 𝑦, 𝐴. (Revised by SN, 3-Jun-2024.) |
| Ref | Expression |
|---|---|
| nfcr | ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nfc 2881 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴) | |
| 2 | eleq1w 2814 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 3 | 2 | nfbidv 1923 | . . 3 ⊢ (𝑧 = 𝑦 → (Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐴)) |
| 4 | 3 | spvv 1989 | . 2 ⊢ (∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| 5 | 1, 4 | sylbi 217 | 1 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1539 Ⅎwnf 1784 ∈ wcel 2111 Ⅎwnfc 2879 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-nf 1785 df-clel 2806 df-nfc 2881 |
| This theorem is referenced by: nfcri 2886 nfcrd 2888 abidnf 3656 csbtt 3862 csbnestgfw 4369 csbnestgf 4374 nfchnd 18517 |
| Copyright terms: Public domain | W3C validator |