| 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 2737 | . . 3 ⊢ ∅ = ∅ | |
| 2 | 1 | orci 866 | . 2 ⊢ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅) |
| 3 | brwdom 9476 | . 2 ⊢ (𝑋 ∈ 𝑉 → (∅ ≼* 𝑋 ↔ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅))) | |
| 4 | 2, 3 | mpbiri 258 | 1 ⊢ (𝑋 ∈ 𝑉 → ∅ ≼* 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 848 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∅c0 4286 class class class wbr 5099 –onto→wfo 6491 ≼* cwdom 9473 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-xp 5631 df-rel 5632 df-cnv 5633 df-dm 5635 df-rn 5636 df-fn 6496 df-fo 6499 df-wdom 9474 |
| This theorem is referenced by: brwdom2 9482 wdomtr 9484 |
| Copyright terms: Public domain | W3C validator |