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

Theorem ltrniotafvawN 33561
Description: Version of cdleme46fvaw 33484 with simpler hypotheses. TODO: Fix comment. (Contributed by NM, 18-Apr-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
ltrniotaval.l  |-  .<_  =  ( le `  K )
ltrniotaval.a  |-  A  =  ( Atoms `  K )
ltrniotaval.h  |-  H  =  ( LHyp `  K
)
ltrniotaval.t  |-  T  =  ( ( LTrn `  K
) `  W )
ltrniotaval.f  |-  F  =  ( iota_ f  e.  T  ( f `  P
)  =  Q )
Assertion
Ref Expression
ltrniotafvawN  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  ->  ( ( F `  R )  e.  A  /\  -.  ( F `  R )  .<_  W ) )
Distinct variable groups:    A, f    f, H    f, K    .<_ , f    P, f    Q, f    T, f   
f, W
Allowed substitution hints:    R( f)    F( f)

Proof of Theorem ltrniotafvawN
Dummy variables  s 
t  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2400 . 2  |-  ( Base `  K )  =  (
Base `  K )
2 ltrniotaval.l . 2  |-  .<_  =  ( le `  K )
3 eqid 2400 . 2  |-  ( join `  K )  =  (
join `  K )
4 eqid 2400 . 2  |-  ( meet `  K )  =  (
meet `  K )
5 ltrniotaval.a . 2  |-  A  =  ( Atoms `  K )
6 ltrniotaval.h . 2  |-  H  =  ( LHyp `  K
)
7 eqid 2400 . 2  |-  ( ( P ( join `  K
) Q ) (
meet `  K ) W )  =  ( ( P ( join `  K ) Q ) ( meet `  K
) W )
8 eqid 2400 . 2  |-  ( ( t ( join `  K
) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) )  =  ( ( t ( join `  K
) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) )
9 eqid 2400 . 2  |-  ( ( P ( join `  K
) Q ) (
meet `  K )
( ( ( t ( join `  K
) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) ) ( join `  K
) ( ( s ( join `  K
) t ) (
meet `  K ) W ) ) )  =  ( ( P ( join `  K
) Q ) (
meet `  K )
( ( ( t ( join `  K
) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) ) ( join `  K
) ( ( s ( join `  K
) t ) (
meet `  K ) W ) ) )
10 eqid 2400 . 2  |-  ( x  e.  ( Base `  K
)  |->  if ( ( P  =/=  Q  /\  -.  x  .<_  W ) ,  ( iota_ z  e.  ( Base `  K
) A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s ( join `  K ) ( x ( meet `  K
) W ) )  =  x )  -> 
z  =  ( if ( s  .<_  ( P ( join `  K
) Q ) ,  ( iota_ y  e.  (
Base `  K ) A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P ( join `  K ) Q ) )  ->  y  =  ( ( P (
join `  K ) Q ) ( meet `  K ) ( ( ( t ( join `  K ) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) ) ( join `  K
) ( ( s ( join `  K
) t ) (
meet `  K ) W ) ) ) ) ) ,  [_ s  /  t ]_ (
( t ( join `  K ) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) ) ) ( join `  K
) ( x (
meet `  K ) W ) ) ) ) ,  x ) )  =  ( x  e.  ( Base `  K
)  |->  if ( ( P  =/=  Q  /\  -.  x  .<_  W ) ,  ( iota_ z  e.  ( Base `  K
) A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s ( join `  K ) ( x ( meet `  K
) W ) )  =  x )  -> 
z  =  ( if ( s  .<_  ( P ( join `  K
) Q ) ,  ( iota_ y  e.  (
Base `  K ) A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P ( join `  K ) Q ) )  ->  y  =  ( ( P (
join `  K ) Q ) ( meet `  K ) ( ( ( t ( join `  K ) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) ) ( join `  K
) ( ( s ( join `  K
) t ) (
meet `  K ) W ) ) ) ) ) ,  [_ s  /  t ]_ (
( t ( join `  K ) ( ( P ( join `  K
) Q ) (
meet `  K ) W ) ) (
meet `  K )
( Q ( join `  K ) ( ( P ( join `  K
) t ) (
meet `  K ) W ) ) ) ) ( join `  K
) ( x (
meet `  K ) W ) ) ) ) ,  x ) )
11 ltrniotaval.t . 2  |-  T  =  ( ( LTrn `  K
) `  W )
12 ltrniotaval.f . 2  |-  F  =  ( iota_ f  e.  T  ( f `  P
)  =  Q )
131, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12cdlemg1fvawlemN 33556 1  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  ->  ( ( F `  R )  e.  A  /\  -.  ( F `  R )  .<_  W ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 367    /\ w3a 972    = wceq 1403    e. wcel 1840    =/= wne 2596   A.wral 2751   [_csb 3370   ifcif 3882   class class class wbr 4392    |-> cmpt 4450   ` cfv 5523   iota_crio 6193  (class class class)co 6232   Basecbs 14731   lecple 14806   joincjn 15787   meetcmee 15788   Atomscatm 32245   HLchlt 32332   LHypclh 32965   LTrncltrn 33082
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1637  ax-4 1650  ax-5 1723  ax-6 1769  ax-7 1812  ax-8 1842  ax-9 1844  ax-10 1859  ax-11 1864  ax-12 1876  ax-13 2024  ax-ext 2378  ax-rep 4504  ax-sep 4514  ax-nul 4522  ax-pow 4569  ax-pr 4627  ax-un 6528  ax-riotaBAD 31941
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 973  df-3an 974  df-tru 1406  df-ex 1632  df-nf 1636  df-sb 1762  df-eu 2240  df-mo 2241  df-clab 2386  df-cleq 2392  df-clel 2395  df-nfc 2550  df-ne 2598  df-nel 2599  df-ral 2756  df-rex 2757  df-reu 2758  df-rmo 2759  df-rab 2760  df-v 3058  df-sbc 3275  df-csb 3371  df-dif 3414  df-un 3416  df-in 3418  df-ss 3425  df-nul 3736  df-if 3883  df-pw 3954  df-sn 3970  df-pr 3972  df-op 3976  df-uni 4189  df-iun 4270  df-iin 4271  df-br 4393  df-opab 4451  df-mpt 4452  df-id 4735  df-xp 4946  df-rel 4947  df-cnv 4948  df-co 4949  df-dm 4950  df-rn 4951  df-res 4952  df-ima 4953  df-iota 5487  df-fun 5525  df-fn 5526  df-f 5527  df-f1 5528  df-fo 5529  df-f1o 5530  df-fv 5531  df-riota 6194  df-ov 6235  df-oprab 6236  df-mpt2 6237  df-1st 6736  df-2nd 6737  df-undef 6957  df-map 7377  df-preset 15771  df-poset 15789  df-plt 15802  df-lub 15818  df-glb 15819  df-join 15820  df-meet 15821  df-p0 15883  df-p1 15884  df-lat 15890  df-clat 15952  df-oposet 32158  df-ol 32160  df-oml 32161  df-covers 32248  df-ats 32249  df-atl 32280  df-cvlat 32304  df-hlat 32333  df-llines 32479  df-lplanes 32480  df-lvols 32481  df-lines 32482  df-psubsp 32484  df-pmap 32485  df-padd 32777  df-lhyp 32969  df-laut 32970  df-ldil 33085  df-ltrn 33086  df-trl 33141
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator