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

Theorem cdlemg1ltrnlem 34581
Description: Lemma for ltrniotacl 34586. (Contributed by NM, 18-Apr-2013.)
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
cdlemg1ltrnlem  |-  ( ( ( 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 cdlemg1ltrnlem
StepHypRef Expression
1 cdlemg1.b . . 3  |-  B  =  ( Base `  K
)
2 cdlemg1.l . . 3  |-  .<_  =  ( le `  K )
3 cdlemg1.j . . 3  |-  .\/  =  ( join `  K )
4 cdlemg1.m . . 3  |-  ./\  =  ( meet `  K )
5 cdlemg1.a . . 3  |-  A  =  ( Atoms `  K )
6 cdlemg1.h . . 3  |-  H  =  ( LHyp `  K
)
7 cdlemg1.u . . 3  |-  U  =  ( ( P  .\/  Q )  ./\  W )
8 cdlemg1.d . . 3  |-  D  =  ( ( t  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  t )  ./\  W
) ) )
9 cdlemg1.e . . 3  |-  E  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  t )  ./\  W
) ) )
10 cdlemg1.g . . 3  |-  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 . . 3  |-  T  =  ( ( LTrn `  K
) `  W )
12 cdlemg1.f . . 3  |-  F  =  ( iota_ f  e.  T  ( f `  P
)  =  Q )
131, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12cdlemg1b2 34578 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  ->  F  =  G )
141, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11cdleme50ltrn 34564 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  ->  G  e.  T )
1513, 14eqeltrd 2542 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 369    /\ w3a 965    = wceq 1370    e. wcel 1758    =/= wne 2648   A.wral 2799   [_csb 3398   ifcif 3902   class class class wbr 4403    |-> cmpt 4461   ` cfv 5529   iota_crio 6163  (class class class)co 6203   Basecbs 14296   lecple 14368   joincjn 15237   meetcmee 15238   Atomscatm 33271   HLchlt 33358   LHypclh 33991   LTrncltrn 34108
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-rep 4514  ax-sep 4524  ax-nul 4532  ax-pow 4581  ax-pr 4642  ax-un 6485  ax-riotaBAD 32967
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2266  df-mo 2267  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2650  df-nel 2651  df-ral 2804  df-rex 2805  df-reu 2806  df-rmo 2807  df-rab 2808  df-v 3080  df-sbc 3295  df-csb 3399  df-dif 3442  df-un 3444  df-in 3446  df-ss 3453  df-nul 3749  df-if 3903  df-pw 3973  df-sn 3989  df-pr 3991  df-op 3995  df-uni 4203  df-iun 4284  df-iin 4285  df-br 4404  df-opab 4462  df-mpt 4463  df-id 4747  df-xp 4957  df-rel 4958  df-cnv 4959  df-co 4960  df-dm 4961  df-rn 4962  df-res 4963  df-ima 4964  df-iota 5492  df-fun 5531  df-fn 5532  df-f 5533  df-f1 5534  df-fo 5535  df-f1o 5536  df-fv 5537  df-riota 6164  df-ov 6206  df-oprab 6207  df-mpt2 6208  df-1st 6690  df-2nd 6691  df-undef 6905  df-map 7329  df-poset 15239  df-plt 15251  df-lub 15267  df-glb 15268  df-join 15269  df-meet 15270  df-p0 15332  df-p1 15333  df-lat 15339  df-clat 15401  df-oposet 33184  df-ol 33186  df-oml 33187  df-covers 33274  df-ats 33275  df-atl 33306  df-cvlat 33330  df-hlat 33359  df-llines 33505  df-lplanes 33506  df-lvols 33507  df-lines 33508  df-psubsp 33510  df-pmap 33511  df-padd 33803  df-lhyp 33995  df-laut 33996  df-ldil 34111  df-ltrn 34112  df-trl 34166
This theorem is referenced by:  ltrniotacl  34586
  Copyright terms: Public domain W3C validator