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

Theorem meetfval2 17016
Description: Value of meet function for a poset. (Contributed by NM, 12-Sep-2011.) (Revised by NM, 9-Sep-2018.)
Hypotheses
Ref Expression
meetfval.u  |-  G  =  ( glb `  K
)
meetfval.m  |-  ./\  =  ( meet `  K )
Assertion
Ref Expression
meetfval2  |-  ( K  e.  V  ->  ./\  =  { <. <. x ,  y
>. ,  z >.  |  ( { x ,  y }  e.  dom  G  /\  z  =  ( G `  { x ,  y } ) ) } )
Distinct variable groups:    x, y,
z, K    z, G
Allowed substitution hints:    G( x, y)    ./\ (
x, y, z)    V( x, y, z)

Proof of Theorem meetfval2
StepHypRef Expression
1 meetfval.u . . 3  |-  G  =  ( glb `  K
)
2 meetfval.m . . 3  |-  ./\  =  ( meet `  K )
31, 2meetfval 17015 . 2  |-  ( K  e.  V  ->  ./\  =  { <. <. x ,  y
>. ,  z >.  |  { x ,  y } G z } )
41glbfun 16993 . . . . 5  |-  Fun  G
5 funbrfv2b 6240 . . . . 5  |-  ( Fun 
G  ->  ( {
x ,  y } G z  <->  ( {
x ,  y }  e.  dom  G  /\  ( G `  { x ,  y } )  =  z ) ) )
64, 5ax-mp 5 . . . 4  |-  ( { x ,  y } G z  <->  ( {
x ,  y }  e.  dom  G  /\  ( G `  { x ,  y } )  =  z ) )
7 eqcom 2629 . . . . 5  |-  ( ( G `  { x ,  y } )  =  z  <->  z  =  ( G `  { x ,  y } ) )
87anbi2i 730 . . . 4  |-  ( ( { x ,  y }  e.  dom  G  /\  ( G `  {
x ,  y } )  =  z )  <-> 
( { x ,  y }  e.  dom  G  /\  z  =  ( G `  { x ,  y } ) ) )
96, 8bitri 264 . . 3  |-  ( { x ,  y } G z  <->  ( {
x ,  y }  e.  dom  G  /\  z  =  ( G `  { x ,  y } ) ) )
109oprabbii 6710 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  {
x ,  y } G z }  =  { <. <. x ,  y
>. ,  z >.  |  ( { x ,  y }  e.  dom  G  /\  z  =  ( G `  { x ,  y } ) ) }
113, 10syl6eq 2672 1  |-  ( K  e.  V  ->  ./\  =  { <. <. x ,  y
>. ,  z >.  |  ( { x ,  y }  e.  dom  G  /\  z  =  ( G `  { x ,  y } ) ) } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   {cpr 4179   class class class wbr 4653   dom cdm 5114   Fun wfun 5882   ` cfv 5888   {coprab 6651   glbcglb 16943   meetcmee 16945
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-oprab 6654  df-glb 16975  df-meet 16977
This theorem is referenced by:  meetdm  17017  meetval  17019
  Copyright terms: Public domain W3C validator