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

Theorem 0domg 9074
Description: Any set dominates the empty set. (Contributed by NM, 26-Oct-2003.) (Revised by Mario Carneiro, 26-Apr-2015.) Avoid ax-pow 5323, ax-un 7714. (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 5265 . . 3 ∅ ∈ V
2 f1eq1 6754 . . 3 (𝑓 = ∅ → (𝑓:∅–1-1𝐴 ↔ ∅:∅–1-1𝐴))
3 f10 6836 . . 3 ∅:∅–1-1𝐴
41, 2, 3ceqsexv2d 3502 . 2 𝑓 𝑓:∅–1-1𝐴
5 brdom2g 8932 . . 3 ((∅ ∈ V ∧ 𝐴𝑉) → (∅ ≼ 𝐴 ↔ ∃𝑓 𝑓:∅–1-1𝐴))
61, 5mpan 690 . 2 (𝐴𝑉 → (∅ ≼ 𝐴 ↔ ∃𝑓 𝑓:∅–1-1𝐴))
74, 6mpbiri 258 1 (𝐴𝑉 → ∅ ≼ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wex 1779  wcel 2109  Vcvv 3450  c0 4299   class class class wbr 5110  1-1wf1 6511  cdom 8919
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-dom 8923
This theorem is referenced by:  0sdomg  9076  0dom  9077  carddomi2  9930  wdomfil  10021  wdomnumr  10024  hashge0  14359  ufildom1  23820  harn0  43098  safesnsupfidom1o  43413  sn1dom  43522
  Copyright terms: Public domain W3C validator