| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > n0rf | GIF version | ||
| Description: An inhabited class is nonempty. Following the Definition of [Bauer], p. 483, we call a class 𝐴 nonempty if 𝐴 ≠ ∅ and inhabited if it has at least one element. In classical logic these two concepts are equivalent, for example see Proposition 5.17(1) of [TakeutiZaring] p. 20. This version of n0r 3535 requires only that 𝑥 not be free in, rather than not occur in, 𝐴. (Contributed by Jim Kingdon, 31-Jul-2018.) |
| Ref | Expression |
|---|---|
| n0rf.1 | ⊢ Ⅎ𝑥𝐴 |
| Ref | Expression |
|---|---|
| n0rf | ⊢ (∃𝑥 𝑥 ∈ 𝐴 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | exalim 1555 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴) | |
| 2 | n0rf.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
| 3 | nfcv 2392 | . . . . 5 ⊢ Ⅎ𝑥∅ | |
| 4 | 2, 3 | cleqf 2417 | . . . 4 ⊢ (𝐴 = ∅ ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 5 | noel 3525 | . . . . . 6 ⊢ ¬ 𝑥 ∈ ∅ | |
| 6 | 5 | nbn 711 | . . . . 5 ⊢ (¬ 𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 7 | 6 | albii 1523 | . . . 4 ⊢ (∀𝑥 ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∅)) |
| 8 | 4, 7 | bitr4i 187 | . . 3 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| 9 | 8 | necon3abii 2456 | . 2 ⊢ (𝐴 ≠ ∅ ↔ ¬ ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| 10 | 1, 9 | sylibr 134 | 1 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → 𝐴 ≠ ∅) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 105 ∀wal 1400 = wceq 1402 ∃wex 1545 ∈ wcel 2209 Ⅎwnfc 2379 ≠ wne 2420 ∅c0 3520 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-v 2823 df-dif 3222 df-nul 3521 |
| This theorem is referenced by: n0r 3535 abn0r 3546 |
| Copyright terms: Public domain | W3C validator |