| 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 2756 | . . 3 ⊢ ∅ = ∅ | |
| 2 | 1 | orci 874 | . 2 ⊢ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅) |
| 3 | brwdom 9505 | . 2 ⊢ (𝑋 ∈ 𝑉 → (∅ ≼* 𝑋 ↔ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅))) | |
| 4 | 2, 3 | mpbiri 260 | 1 ⊢ (𝑋 ∈ 𝑉 → ∅ ≼* 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 856 = wceq 1554 ∃wex 1793 ∈ wcel 2136 ∅c0 4280 class class class wbr 5094 –onto→wfo 6508 ≼* cwdom 9502 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pr 5384 ax-un 7707 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-sb 2085 df-clab 2735 df-cleq 2748 df-clel 2831 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4281 df-if 4475 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5095 df-opab 5157 df-xp 5646 df-rel 5647 df-cnv 5648 df-dm 5650 df-rn 5651 df-fn 6513 df-fo 6516 df-wdom 9503 |
| This theorem is referenced by: brwdom2 9511 wdomtr 9513 |
| Copyright terms: Public domain | W3C validator |