Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ustne0 | Structured version Visualization version GIF version |
Description: A uniform structure cannot be empty. (Contributed by Thierry Arnoux, 16-Nov-2017.) |
Ref | Expression |
---|---|
ustne0 | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ustbasel 22912 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) ∈ 𝑈) | |
2 | 1 | ne0d 4236 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2111 ≠ wne 2951 ∅c0 4227 × cxp 5525 ‘cfv 6339 UnifOncust 22905 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5172 ax-nul 5179 ax-pow 5237 ax-pr 5301 ax-un 7464 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-ral 3075 df-rex 3076 df-rab 3079 df-v 3411 df-sbc 3699 df-dif 3863 df-un 3865 df-in 3867 df-ss 3877 df-nul 4228 df-if 4424 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4802 df-br 5036 df-opab 5098 df-mpt 5116 df-id 5433 df-xp 5533 df-rel 5534 df-cnv 5535 df-co 5536 df-dm 5537 df-res 5539 df-iota 6298 df-fun 6341 df-fv 6347 df-ust 22906 |
This theorem is referenced by: utopbas 22941 cstucnd 22990 |
Copyright terms: Public domain | W3C validator |