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

Theorem brwdom3i 9342
Description: Weak dominance implies existence of a covering function. (Contributed by Stefan O'Rear, 13-Feb-2015.)
Assertion
Ref Expression
brwdom3i (𝑋* 𝑌 → ∃𝑓𝑥𝑋𝑦𝑌 𝑥 = (𝑓𝑦))
Distinct variable groups:   𝑓,𝑋,𝑥,𝑦   𝑓,𝑌,𝑥,𝑦

Proof of Theorem brwdom3i
StepHypRef Expression
1 relwdom 9325 . . . 4 Rel ≼*
21brrelex1i 5643 . . 3 (𝑋* 𝑌𝑋 ∈ V)
31brrelex2i 5644 . . 3 (𝑋* 𝑌𝑌 ∈ V)
4 brwdom3 9341 . . 3 ((𝑋 ∈ V ∧ 𝑌 ∈ V) → (𝑋* 𝑌 ↔ ∃𝑓𝑥𝑋𝑦𝑌 𝑥 = (𝑓𝑦)))
52, 3, 4syl2anc 584 . 2 (𝑋* 𝑌 → (𝑋* 𝑌 ↔ ∃𝑓𝑥𝑋𝑦𝑌 𝑥 = (𝑓𝑦)))
65ibi 266 1 (𝑋* 𝑌 → ∃𝑓𝑥𝑋𝑦𝑌 𝑥 = (𝑓𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1539  wex 1782  wcel 2106  wral 3064  wrex 3065  Vcvv 3432   class class class wbr 5074  cfv 6433  * cwdom 9323
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-en 8734  df-dom 8735  df-sdom 8736  df-wdom 9324
This theorem is referenced by:  unwdomg  9343  xpwdomg  9344
  Copyright terms: Public domain W3C validator