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

Theorem brdom2g 9022
Description: Dominance relation. This variation of brdomg 9023 does not require the Axiom of Union. (Contributed by NM, 15-Jun-1998.) Extract from a subproof of brdomg 9023. (Revised by BTernaryTau, 29-Nov-2024.)
Assertion
Ref Expression
brdom2g ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴⟶1-1𝐵))
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓
Allowed substitution hints:   𝑉(𝑓)   𝑊(𝑓)

Proof of Theorem brdom2g
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1eq2 6804 . . 3 (𝑥 = 𝐴 → (𝑓:𝑥⟶1-1𝑦 ↔ 𝑓:𝐴⟶1-1𝑦))
21exbidv 1956 . 2 (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥⟶1-1𝑦 ↔ ∃𝑓 𝑓:𝐴⟶1-1𝑦))
3 f1eq3 6805 . . 3 (𝑦 = 𝐵 → (𝑓:𝐴⟶1-1𝑦 ↔ 𝑓:𝐴⟶1-1𝐵))
43exbidv 1956 . 2 (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴⟶1-1𝑦 ↔ ∃𝑓 𝑓:𝐴⟶1-1𝐵))
5 df-dom 9013 . 2 ≼ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥⟶1-1𝑦}
62, 4, 5brabg 5521 1 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴⟶1-1𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147   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-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-clab 2742  df-cleq 2755  df-clel 2839  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-fn 6569  df-f 6570  df-f1 6571  df-dom 9013
This theorem is used by:  brdomg  9023  brdomi  9024  f1dom4g  9030  0domg  9161
  Copyright terms: Public domain W3C validator