Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdlemg1finvtrlemN Structured version   Visualization version   Unicode version

Theorem cdlemg1finvtrlemN 35863
Description: Lemma for ltrniotacnvN 35868. (Contributed by NM, 18-Apr-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemg1.b  |-  B  =  ( Base `  K
)
cdlemg1.l  |-  .<_  =  ( le `  K )
cdlemg1.j  |-  .\/  =  ( join `  K )
cdlemg1.m  |-  ./\  =  ( meet `  K )
cdlemg1.a  |-  A  =  ( Atoms `  K )
cdlemg1.h  |-  H  =  ( LHyp `  K
)
cdlemg1.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
cdlemg1.d  |-  D  =  ( ( t  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  t )  ./\  W
) ) )
cdlemg1.e  |-  E  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  t )  ./\  W
) ) )
cdlemg1.g  |-  G  =  ( x  e.  B  |->  if ( ( P  =/=  Q  /\  -.  x  .<_  W ) ,  ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( if ( s  .<_  ( P  .\/  Q ) ,  ( iota_ y  e.  B  A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  E ) ) ,  [_ s  /  t ]_ D
)  .\/  ( x  ./\ 
W ) ) ) ) ,  x ) )
cdlemg1.t  |-  T  =  ( ( LTrn `  K
) `  W )
cdlemg1.f  |-  F  =  ( iota_ f  e.  T  ( f `  P
)  =  Q )
Assertion
Ref Expression
cdlemg1finvtrlemN  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  ->  `' F  e.  T )
Distinct variable groups:    t, s, x, y, z, A, f    B, f, s, t, x, y, z    D, f, s, x, y, z   
f, E, x, y, z    H, s, t, x, y, z    .\/ , f,
s, t, x, y, z    K, s, t, x, y, z    .<_ , s, t, x, y, z    ./\ , f,
s, t, x, y, z    P, s, t, x, y, z    Q, s, t, x, y, z    U, s, t, x, y, z    W, s, t, x, y, z    A, f   
f, H    f, K    .<_ , f    P, f    Q, f    T, f    f, W    f, G
Allowed substitution hints:    D( t)    T( x, y, z, t, s)    U( f)    E( t, s)    F( x, y, z, t, f, s)    G( x, y, z, t, s)

Proof of Theorem cdlemg1finvtrlemN
StepHypRef Expression
1 cdlemg1.b . . . 4  |-  B  =  ( Base `  K
)
2 cdlemg1.l . . . 4  |-  .<_  =  ( le `  K )
3 cdlemg1.j . . . 4  |-  .\/  =  ( join `  K )
4 cdlemg1.m . . . 4  |-  ./\  =  ( meet `  K )
5 cdlemg1.a . . . 4  |-  A  =  ( Atoms `  K )
6 cdlemg1.h . . . 4  |-  H  =  ( LHyp `  K
)
7 cdlemg1.u . . . 4  |-  U  =  ( ( P  .\/  Q )  ./\  W )
8 cdlemg1.d . . . 4  |-  D  =  ( ( t  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  t )  ./\  W
) ) )
9 cdlemg1.e . . . 4  |-  E  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  t )  ./\  W
) ) )
10 cdlemg1.g . . . 4  |-  G  =  ( x  e.  B  |->  if ( ( P  =/=  Q  /\  -.  x  .<_  W ) ,  ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( if ( s  .<_  ( P  .\/  Q ) ,  ( iota_ y  e.  B  A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  E ) ) ,  [_ s  /  t ]_ D
)  .\/  ( x  ./\ 
W ) ) ) ) ,  x ) )
11 cdlemg1.t . . . 4  |-  T  =  ( ( LTrn `  K
) `  W )
12 cdlemg1.f . . . 4  |-  F  =  ( iota_ f  e.  T  ( f `  P
)  =  Q )
131, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12cdlemg1b2 35859 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  ->  F  =  G )
1413cnveqd 5298 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  ->  `' F  =  `' G )
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11cdleme51finvtrN 35846 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  ->  `' G  e.  T )
1614, 15eqeltrd 2701 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  ->  `' F  e.  T )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990    =/= wne 2794   A.wral 2912   [_csb 3533   ifcif 4086   class class class wbr 4653    |-> cmpt 4729   `'ccnv 5113   ` cfv 5888   iota_crio 6610  (class class class)co 6650   Basecbs 15857   lecple 15948   joincjn 16944   meetcmee 16945   Atomscatm 34550   HLchlt 34637   LHypclh 35270   LTrncltrn 35387
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  ax-riotaBAD 34239
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  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-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  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-iin 4523  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-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-undef 7399  df-map 7859  df-preset 16928  df-poset 16946  df-plt 16958  df-lub 16974  df-glb 16975  df-join 16976  df-meet 16977  df-p0 17039  df-p1 17040  df-lat 17046  df-clat 17108  df-oposet 34463  df-ol 34465  df-oml 34466  df-covers 34553  df-ats 34554  df-atl 34585  df-cvlat 34609  df-hlat 34638  df-llines 34784  df-lplanes 34785  df-lvols 34786  df-lines 34787  df-psubsp 34789  df-pmap 34790  df-padd 35082  df-lhyp 35274  df-laut 35275  df-ldil 35390  df-ltrn 35391  df-trl 35446
This theorem is referenced by:  ltrniotacnvN  35868
  Copyright terms: Public domain W3C validator