MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  0domg Structured version   Visualization version   GIF version

Theorem 0domg 9161
Description: Any set dominates the empty set. (Contributed by NM, 26-Oct-2003.) (Revised by Mario Carneiro, 26-Apr-2015.) Avoid ax-pow 5334, ax-un 7783. (Revised by BTernaryTau, 29-Nov-2024.)
Assertion
Ref Expression
0domg (𝐴 ∈ 𝑉 → ∅ ≼ 𝐴)

Proof of Theorem 0domg
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 0ex 5267 . . 3 ∅ ∈ V
2 f1eq1 6803 . . 3 (𝑓 = ∅ → (𝑓:∅⟶1-1𝐴 ↔ ∅:∅⟶1-1𝐴))
3 f10 6889 . . 3 ∅:∅⟶1-1𝐴
41, 2, 3ceqsexv2d 3503 . 2 ∃𝑓 𝑓:∅⟶1-1𝐴
5 brdom2g 9022 . . 3 ((∅ ∈ V ∧ 𝐴 ∈ 𝑉) → (∅ ≼ 𝐴 ↔ ∃𝑓 𝑓:∅⟶1-1𝐴))
61, 5mpan 703 . 2 (𝐴 ∈ 𝑉 → (∅ ≼ 𝐴 ↔ ∃𝑓 𝑓:∅⟶1-1𝐴))
74, 6mpbiri 261 1 (𝐴 ∈ 𝑉 → ∅ ≼ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∃wex 1812   ∈ wcel 2147  Vcvv 3454  ∅c0 4281   class class class wbr 5108  ⟶1-1wf1 6563   ≼ cdom 9009
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-dom 9013
This theorem is used by:  0sdomg  9163  0dom  9164  carddomi2  10088  wdomfil  10179  wdomnumr  10182  hashge0  14572  ufildom1  24300  harn0  44369  safesnsupfidom1o  44740  sn1dom  44849
  Copyright terms: Public domain W3C validator