| 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 2740 | . . 3 ⊢ ∅ = ∅ | |
| 2 | 1 | orci 871 | . 2 ⊢ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅) |
| 3 | brwdom 9479 | . 2 ⊢ (𝑋 ∈ 𝑉 → (∅ ≼* 𝑋 ↔ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅))) | |
| 4 | 2, 3 | mpbiri 259 | 1 ⊢ (𝑋 ∈ 𝑉 → ∅ ≼* 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 853 = wceq 1547 ∃wex 1786 ∈ wcel 2119 ∅c0 4268 class class class wbr 5079 –onto→wfo 6490 ≼* cwdom 9476 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-xp 5631 df-rel 5632 df-cnv 5633 df-dm 5635 df-rn 5636 df-fn 6495 df-fo 6498 df-wdom 9477 |
| This theorem is referenced by: brwdom2 9485 wdomtr 9487 |
| Copyright terms: Public domain | W3C validator |