HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem brrelexi 2447
Description: The first argument of a binary relation exists. (An artifact of our ordered pair definition.)
Hypothesis
Ref Expression
brrelexi.1 |- Rel R
Assertion
Ref Expression
brrelexi |- (ARB -> A e. V)

Proof of Theorem brrelexi
StepHypRef Expression
1 brrelexi.1 . 2 |- Rel R
2 brrelex 2446 . 2 |- ((Rel R /\ ARB) -> A e. V)
31, 2mpan 518 1 |- (ARB -> A e. V)
Colors of variables: wff set class
Syntax hints:   -> wi 2   e. wcel 1092  Vcvv 1348   class class class wbr 2054  Rel wrel 2415
This theorem is referenced by:  vtoclr 2449  vtoclrbr 2450  vtoclibr 2451  oprprc1 3019  breng 3280  brdomg 3281  sdomirr 3314  sdomex 3315  ensymg 3316  unen 3338  sbth 3359  domnsym 3365  ensdomtr 3372  domsdomtr 3374  sdomen2 3380  php3 3411  infsdomnn 3426  alephnbtwn2 3675  alephsucdom 3685  prcdpq 3891
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-opab 2098  df-xp 2424  df-rel 2425
metamath.org