Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > df-nfc | GIF version |
Description: Define the not-free predicate for classes. This is read "𝑥 is not free in 𝐴". Not-free means that the value of 𝑥 cannot affect the value of 𝐴, e.g., any occurrence of 𝑥 in 𝐴 is effectively bound by a quantifier or something that expands to one (such as "there exists at most one"). It is defined in terms of the not-free predicate df-nf 1449 for wffs; see that definition for more information. (Contributed by Mario Carneiro, 11-Aug-2016.) |
Ref | Expression |
---|---|
df-nfc | ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vx | . . 3 setvar 𝑥 | |
2 | cA | . . 3 class 𝐴 | |
3 | 1, 2 | wnfc 2295 | . 2 wff Ⅎ𝑥𝐴 |
4 | vy | . . . . . 6 setvar 𝑦 | |
5 | 4 | cv 1342 | . . . . 5 class 𝑦 |
6 | 5, 2 | wcel 2136 | . . . 4 wff 𝑦 ∈ 𝐴 |
7 | 6, 1 | wnf 1448 | . . 3 wff Ⅎ𝑥 𝑦 ∈ 𝐴 |
8 | 7, 4 | wal 1341 | . 2 wff ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴 |
9 | 3, 8 | wb 104 | 1 wff (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) |
Colors of variables: wff set class |
This definition is referenced by: nfci 2298 nfcr 2300 nfcd 2303 nfceqi 2304 nfceqdf 2307 nfnfc1 2311 nfnfc 2315 drnfc1 2325 drnfc2 2326 dfnfc2 3807 |
Copyright terms: Public domain | W3C validator |