![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > infn0 | GIF version |
Description: An infinite set is not empty. (Contributed by NM, 23-Oct-2004.) |
Ref | Expression |
---|---|
infn0 | ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | infm 6806 | . 2 ⊢ (ω ≼ 𝐴 → ∃𝑥 𝑥 ∈ 𝐴) | |
2 | n0r 3381 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → 𝐴 ≠ ∅) | |
3 | 1, 2 | syl 14 | 1 ⊢ (ω ≼ 𝐴 → 𝐴 ≠ ∅) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∃wex 1469 ∈ wcel 1481 ≠ wne 2309 ∅c0 3368 class class class wbr 3937 ωcom 4512 ≼ cdom 6641 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-v 2691 df-sbc 2914 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-int 3780 df-br 3938 df-opab 3998 df-id 4223 df-iom 4513 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fv 5139 df-dom 6644 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |