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

Theorem brdom4 10217
Description: An equivalence to a dominance relation. (Contributed by NM, 28-Mar-2007.) (Revised by NM, 16-Jun-2017.)
Hypothesis
Ref Expression
brdom3.2 𝐵 ∈ V
Assertion
Ref Expression
brdom4 (𝐴𝐵 ↔ ∃𝑓(∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥))
Distinct variable groups:   𝑥,𝑓,𝑦,𝐴   𝐵,𝑓,𝑥,𝑦

Proof of Theorem brdom4
StepHypRef Expression
1 brdom3.2 . . . 4 𝐵 ∈ V
21brdom3 10215 . . 3 (𝐴𝐵 ↔ ∃𝑓(∀𝑥∃*𝑦 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥))
3 mormo 3350 . . . . . . 7 (∃*𝑦 𝑥𝑓𝑦 → ∃*𝑦𝐴 𝑥𝑓𝑦)
43alimi 1815 . . . . . 6 (∀𝑥∃*𝑦 𝑥𝑓𝑦 → ∀𝑥∃*𝑦𝐴 𝑥𝑓𝑦)
5 alral 3079 . . . . . 6 (∀𝑥∃*𝑦𝐴 𝑥𝑓𝑦 → ∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦)
64, 5syl 17 . . . . 5 (∀𝑥∃*𝑦 𝑥𝑓𝑦 → ∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦)
76anim1i 614 . . . 4 ((∀𝑥∃*𝑦 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥) → (∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥))
87eximi 1838 . . 3 (∃𝑓(∀𝑥∃*𝑦 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥) → ∃𝑓(∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥))
92, 8sylbi 216 . 2 (𝐴𝐵 → ∃𝑓(∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥))
10 inss2 4160 . . . . . . . . . . . . . . 15 (𝑓 ∩ (𝐵 × 𝐴)) ⊆ (𝐵 × 𝐴)
11 dmss 5800 . . . . . . . . . . . . . . 15 ((𝑓 ∩ (𝐵 × 𝐴)) ⊆ (𝐵 × 𝐴) → dom (𝑓 ∩ (𝐵 × 𝐴)) ⊆ dom (𝐵 × 𝐴))
1210, 11ax-mp 5 . . . . . . . . . . . . . 14 dom (𝑓 ∩ (𝐵 × 𝐴)) ⊆ dom (𝐵 × 𝐴)
13 dmxpss 6063 . . . . . . . . . . . . . 14 dom (𝐵 × 𝐴) ⊆ 𝐵
1412, 13sstri 3926 . . . . . . . . . . . . 13 dom (𝑓 ∩ (𝐵 × 𝐴)) ⊆ 𝐵
1514sseli 3913 . . . . . . . . . . . 12 (𝑥 ∈ dom (𝑓 ∩ (𝐵 × 𝐴)) → 𝑥𝐵)
1610rnssi 5838 . . . . . . . . . . . . . . . . 17 ran (𝑓 ∩ (𝐵 × 𝐴)) ⊆ ran (𝐵 × 𝐴)
17 rnxpss 6064 . . . . . . . . . . . . . . . . 17 ran (𝐵 × 𝐴) ⊆ 𝐴
1816, 17sstri 3926 . . . . . . . . . . . . . . . 16 ran (𝑓 ∩ (𝐵 × 𝐴)) ⊆ 𝐴
1918sseli 3913 . . . . . . . . . . . . . . 15 (𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴)) → 𝑦𝐴)
20 inss1 4159 . . . . . . . . . . . . . . . 16 (𝑓 ∩ (𝐵 × 𝐴)) ⊆ 𝑓
2120ssbri 5115 . . . . . . . . . . . . . . 15 (𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦𝑥𝑓𝑦)
2219, 21anim12i 612 . . . . . . . . . . . . . 14 ((𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴)) ∧ 𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦) → (𝑦𝐴𝑥𝑓𝑦))
2322moimi 2545 . . . . . . . . . . . . 13 (∃*𝑦(𝑦𝐴𝑥𝑓𝑦) → ∃*𝑦(𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴)) ∧ 𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦))
24 df-rmo 3071 . . . . . . . . . . . . 13 (∃*𝑦𝐴 𝑥𝑓𝑦 ↔ ∃*𝑦(𝑦𝐴𝑥𝑓𝑦))
25 df-rmo 3071 . . . . . . . . . . . . 13 (∃*𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴))𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦 ↔ ∃*𝑦(𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴)) ∧ 𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦))
2623, 24, 253imtr4i 291 . . . . . . . . . . . 12 (∃*𝑦𝐴 𝑥𝑓𝑦 → ∃*𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴))𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦)
2715, 26imim12i 62 . . . . . . . . . . 11 ((𝑥𝐵 → ∃*𝑦𝐴 𝑥𝑓𝑦) → (𝑥 ∈ dom (𝑓 ∩ (𝐵 × 𝐴)) → ∃*𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴))𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦))
2827ralimi2 3083 . . . . . . . . . 10 (∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 → ∀𝑥 ∈ dom (𝑓 ∩ (𝐵 × 𝐴))∃*𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴))𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦)
29 relinxp 5713 . . . . . . . . . 10 Rel (𝑓 ∩ (𝐵 × 𝐴))
3028, 29jctil 519 . . . . . . . . 9 (∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 → (Rel (𝑓 ∩ (𝐵 × 𝐴)) ∧ ∀𝑥 ∈ dom (𝑓 ∩ (𝐵 × 𝐴))∃*𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴))𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦))
31 dffun9 6447 . . . . . . . . 9 (Fun (𝑓 ∩ (𝐵 × 𝐴)) ↔ (Rel (𝑓 ∩ (𝐵 × 𝐴)) ∧ ∀𝑥 ∈ dom (𝑓 ∩ (𝐵 × 𝐴))∃*𝑦 ∈ ran (𝑓 ∩ (𝐵 × 𝐴))𝑥(𝑓 ∩ (𝐵 × 𝐴))𝑦))
3230, 31sylibr 233 . . . . . . . 8 (∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 → Fun (𝑓 ∩ (𝐵 × 𝐴)))
3332funfnd 6449 . . . . . . 7 (∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 → (𝑓 ∩ (𝐵 × 𝐴)) Fn dom (𝑓 ∩ (𝐵 × 𝐴)))
34 rninxp 6071 . . . . . . . 8 (ran (𝑓 ∩ (𝐵 × 𝐴)) = 𝐴 ↔ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥)
3534biimpri 227 . . . . . . 7 (∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥 → ran (𝑓 ∩ (𝐵 × 𝐴)) = 𝐴)
3633, 35anim12i 612 . . . . . 6 ((∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥) → ((𝑓 ∩ (𝐵 × 𝐴)) Fn dom (𝑓 ∩ (𝐵 × 𝐴)) ∧ ran (𝑓 ∩ (𝐵 × 𝐴)) = 𝐴))
37 df-fo 6424 . . . . . 6 ((𝑓 ∩ (𝐵 × 𝐴)):dom (𝑓 ∩ (𝐵 × 𝐴))–onto𝐴 ↔ ((𝑓 ∩ (𝐵 × 𝐴)) Fn dom (𝑓 ∩ (𝐵 × 𝐴)) ∧ ran (𝑓 ∩ (𝐵 × 𝐴)) = 𝐴))
3836, 37sylibr 233 . . . . 5 ((∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥) → (𝑓 ∩ (𝐵 × 𝐴)):dom (𝑓 ∩ (𝐵 × 𝐴))–onto𝐴)
39 vex 3426 . . . . . . . 8 𝑓 ∈ V
4039inex1 5236 . . . . . . 7 (𝑓 ∩ (𝐵 × 𝐴)) ∈ V
4140dmex 7732 . . . . . 6 dom (𝑓 ∩ (𝐵 × 𝐴)) ∈ V
4241fodom 10210 . . . . 5 ((𝑓 ∩ (𝐵 × 𝐴)):dom (𝑓 ∩ (𝐵 × 𝐴))–onto𝐴𝐴 ≼ dom (𝑓 ∩ (𝐵 × 𝐴)))
4338, 42syl 17 . . . 4 ((∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥) → 𝐴 ≼ dom (𝑓 ∩ (𝐵 × 𝐴)))
44 ssdomg 8741 . . . . 5 (𝐵 ∈ V → (dom (𝑓 ∩ (𝐵 × 𝐴)) ⊆ 𝐵 → dom (𝑓 ∩ (𝐵 × 𝐴)) ≼ 𝐵))
451, 14, 44mp2 9 . . . 4 dom (𝑓 ∩ (𝐵 × 𝐴)) ≼ 𝐵
46 domtr 8748 . . . 4 ((𝐴 ≼ dom (𝑓 ∩ (𝐵 × 𝐴)) ∧ dom (𝑓 ∩ (𝐵 × 𝐴)) ≼ 𝐵) → 𝐴𝐵)
4743, 45, 46sylancl 585 . . 3 ((∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥) → 𝐴𝐵)
4847exlimiv 1934 . 2 (∃𝑓(∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥) → 𝐴𝐵)
499, 48impbii 208 1 (𝐴𝐵 ↔ ∃𝑓(∀𝑥𝐵 ∃*𝑦𝐴 𝑥𝑓𝑦 ∧ ∀𝑥𝐴𝑦𝐵 𝑦𝑓𝑥))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395  wal 1537   = wceq 1539  wex 1783  wcel 2108  ∃*wmo 2538  wral 3063  wrex 3064  ∃*wrmo 3066  Vcvv 3422  cin 3882  wss 3883   class class class wbr 5070   × cxp 5578  dom cdm 5580  ran crn 5581  Rel wrel 5585  Fun wfun 6412   Fn wfn 6413  ontowfo 6416  cdom 8689
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-ac2 10150
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-er 8456  df-map 8575  df-en 8692  df-dom 8693  df-sdom 8694  df-card 9628  df-acn 9631  df-ac 9803
This theorem is referenced by:  brdom7disj  10218
  Copyright terms: Public domain W3C validator