| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0wdom | Structured version Visualization version GIF version | ||
| Description: Any set weakly dominates the empty set. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
| Ref | Expression |
|---|---|
| 0wdom | ⊢ (𝑋 ∈ 𝑉 → ∅ ≼* 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . 3 ⊢ ∅ = ∅ | |
| 2 | 1 | orci 878 | . 2 ⊢ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅) |
| 3 | brwdom 9517 | . 2 ⊢ (𝑋 ∈ 𝑉 → (∅ ≼* 𝑋 ↔ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅))) | |
| 4 | 2, 3 | mpbiri 261 | 1 ⊢ (𝑋 ∈ 𝑉 → ∅ ≼* 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 = wceq 1563 ∃wex 1802 ∈ wcel 2145 ∅c0 4288 class class class wbr 5105 –onto→wfo 6523 ≼* cwdom 9514 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-xp 5658 df-rel 5659 df-cnv 5660 df-dm 5662 df-rn 5663 df-fn 6528 df-fo 6531 df-wdom 9515 |
| This theorem is referenced by: brwdom2 9523 wdomtr 9525 |
| Copyright terms: Public domain | W3C validator |