![]() |
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 2736 | . . 3 ⊢ ∅ = ∅ | |
2 | 1 | orci 863 | . 2 ⊢ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅) |
3 | brwdom 9500 | . 2 ⊢ (𝑋 ∈ 𝑉 → (∅ ≼* 𝑋 ↔ (∅ = ∅ ∨ ∃𝑧 𝑧:𝑋–onto→∅))) | |
4 | 2, 3 | mpbiri 257 | 1 ⊢ (𝑋 ∈ 𝑉 → ∅ ≼* 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 845 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ∅c0 4281 class class class wbr 5104 –onto→wfo 6492 ≼* cwdom 9497 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2707 ax-sep 5255 ax-nul 5262 ax-pr 5383 ax-un 7669 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2714 df-cleq 2728 df-clel 2814 df-ral 3064 df-rex 3073 df-rab 3407 df-v 3446 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-nul 4282 df-if 4486 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-br 5105 df-opab 5167 df-xp 5638 df-rel 5639 df-cnv 5640 df-dm 5642 df-rn 5643 df-fn 6497 df-fo 6500 df-wdom 9498 |
This theorem is referenced by: brwdom2 9506 wdomtr 9508 |
Copyright terms: Public domain | W3C validator |