ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  brcodir Unicode version

Theorem brcodir 4655
Description: Two ways of saying that two elements have an upper bound. (Contributed by Mario Carneiro, 3-Nov-2015.)
Assertion
Ref Expression
brcodir  V  W  `' R  o.  R  R  R
Distinct variable groups:   ,   ,   , R   , V   , W

Proof of Theorem brcodir
StepHypRef Expression
1 brcog 4445 . 2  V  W  `' R  o.  R  R  `' R
2 vex 2554 . . . . . 6 
_V
3 brcnvg 4459 . . . . . 6  _V  W  `' R  R
42, 3mpan 400 . . . . 5  W  `' R  R
54anbi2d 437 . . . 4  W  R  `' R  R  R
65adantl 262 . . 3  V  W  R  `' R  R  R
76exbidv 1703 . 2  V  W  R  `' R  R  R
81, 7bitrd 177 1  V  W  `' R  o.  R  R  R
Colors of variables: wff set class
Syntax hints:   wi 4   wa 97   wb 98  wex 1378   wcel 1390   _Vcvv 2551   class class class wbr 3755   `'ccnv 4287    o. ccom 4292
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-14 1402  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019  ax-sep 3866  ax-pow 3918  ax-pr 3935
This theorem depends on definitions:  df-bi 110  df-3an 886  df-tru 1245  df-nf 1347  df-sb 1643  df-eu 1900  df-mo 1901  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-v 2553  df-un 2916  df-in 2918  df-ss 2925  df-pw 3353  df-sn 3373  df-pr 3374  df-op 3376  df-br 3756  df-opab 3810  df-cnv 4296  df-co 4297
This theorem is referenced by:  codir  4656
  Copyright terms: Public domain W3C validator