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

Theorem brcodir 5014
Description: Two ways of saying that two elements have an upper bound. (Contributed by Mario Carneiro, 3-Nov-2015.)
Assertion
Ref Expression
brcodir  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A ( `' R  o.  R ) B  <->  E. z ( A R z  /\  B R z ) ) )
Distinct variable groups:    z, A    z, B    z, R    z, V    z, W

Proof of Theorem brcodir
StepHypRef Expression
1 brcog 4792 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A ( `' R  o.  R ) B  <->  E. z ( A R z  /\  z `' R B ) ) )
2 vex 2740 . . . . . 6  |-  z  e. 
_V
3 brcnvg 4806 . . . . . 6  |-  ( ( z  e.  _V  /\  B  e.  W )  ->  ( z `' R B 
<->  B R z ) )
42, 3mpan 424 . . . . 5  |-  ( B  e.  W  ->  (
z `' R B  <-> 
B R z ) )
54anbi2d 464 . . . 4  |-  ( B  e.  W  ->  (
( A R z  /\  z `' R B )  <->  ( A R z  /\  B R z ) ) )
65adantl 277 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( ( A R z  /\  z `' R B )  <->  ( A R z  /\  B R z ) ) )
76exbidv 1825 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( E. z ( A R z  /\  z `' R B )  <->  E. z
( A R z  /\  B R z ) ) )
81, 7bitrd 188 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A ( `' R  o.  R ) B  <->  E. z ( A R z  /\  B R z ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   E.wex 1492    e. wcel 2148   _Vcvv 2737   class class class wbr 4002   `'ccnv 4624    o. ccom 4629
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4120  ax-pow 4173  ax-pr 4208
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-br 4003  df-opab 4064  df-cnv 4633  df-co 4634
This theorem is referenced by:  codir  5015
  Copyright terms: Public domain W3C validator