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

Theorem brcodir 5008
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 4787 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A ( `' R  o.  R ) B  <->  E. z ( A R z  /\  z `' R B ) ) )
2 vex 2738 . . . . . 6  |-  z  e. 
_V
3 brcnvg 4801 . . . . . 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 1823 . 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 1490    e. wcel 2146   _Vcvv 2735   class class class wbr 3998   `'ccnv 4619    o. ccom 4624
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 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-v 2737  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-br 3999  df-opab 4060  df-cnv 4628  df-co 4629
This theorem is referenced by:  codir  5009
  Copyright terms: Public domain W3C validator