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

Theorem isltrn2N 35272
Description: The predicate "is a lattice translation". Version of isltrn 35271 that considers only different  p and  q. TODO: Can this eliminate some separate proofs for the 
p  =  q case? (Contributed by NM, 22-Apr-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
ltrnset.l  |-  .<_  =  ( le `  K )
ltrnset.j  |-  .\/  =  ( join `  K )
ltrnset.m  |-  ./\  =  ( meet `  K )
ltrnset.a  |-  A  =  ( Atoms `  K )
ltrnset.h  |-  H  =  ( LHyp `  K
)
ltrnset.d  |-  D  =  ( ( LDil `  K
) `  W )
ltrnset.t  |-  T  =  ( ( LTrn `  K
) `  W )
Assertion
Ref Expression
isltrn2N  |-  ( ( K  e.  B  /\  W  e.  H )  ->  ( F  e.  T  <->  ( F  e.  D  /\  A. p  e.  A  A. q  e.  A  (
( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q
)  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) ) ) )
Distinct variable groups:    q, p, A    K, p, q    W, p, q    F, p, q
Allowed substitution hints:    B( q, p)    D( q, p)    T( q, p)    H( q, p)    .\/ ( q, p)   
.<_ ( q, p)    ./\ ( q, p)

Proof of Theorem isltrn2N
StepHypRef Expression
1 ltrnset.l . . 3  |-  .<_  =  ( le `  K )
2 ltrnset.j . . 3  |-  .\/  =  ( join `  K )
3 ltrnset.m . . 3  |-  ./\  =  ( meet `  K )
4 ltrnset.a . . 3  |-  A  =  ( Atoms `  K )
5 ltrnset.h . . 3  |-  H  =  ( LHyp `  K
)
6 ltrnset.d . . 3  |-  D  =  ( ( LDil `  K
) `  W )
7 ltrnset.t . . 3  |-  T  =  ( ( LTrn `  K
) `  W )
81, 2, 3, 4, 5, 6, 7isltrn 35271 . 2  |-  ( ( K  e.  B  /\  W  e.  H )  ->  ( F  e.  T  <->  ( F  e.  D  /\  A. p  e.  A  A. q  e.  A  (
( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) ) ) ) )
9 3simpa 993 . . . . . 6  |-  ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q )  -> 
( -.  p  .<_  W  /\  -.  q  .<_  W ) )
109imim1i 58 . . . . 5  |-  ( ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) )  ->  (
( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q
)  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) )
11 3anass 977 . . . . . . . . 9  |-  ( ( p  =/=  q  /\  -.  p  .<_  W  /\  -.  q  .<_  W )  <-> 
( p  =/=  q  /\  ( -.  p  .<_  W  /\  -.  q  .<_  W ) ) )
12 3anrot 978 . . . . . . . . 9  |-  ( ( p  =/=  q  /\  -.  p  .<_  W  /\  -.  q  .<_  W )  <-> 
( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q
) )
13 df-ne 2664 . . . . . . . . . 10  |-  ( p  =/=  q  <->  -.  p  =  q )
1413anbi1i 695 . . . . . . . . 9  |-  ( ( p  =/=  q  /\  ( -.  p  .<_  W  /\  -.  q  .<_  W ) )  <->  ( -.  p  =  q  /\  ( -.  p  .<_  W  /\  -.  q  .<_  W ) ) )
1511, 12, 143bitr3i 275 . . . . . . . 8  |-  ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q )  <->  ( -.  p  =  q  /\  ( -.  p  .<_  W  /\  -.  q  .<_  W ) ) )
1615imbi1i 325 . . . . . . 7  |-  ( ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q
)  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) )  <-> 
( ( -.  p  =  q  /\  ( -.  p  .<_  W  /\  -.  q  .<_  W ) )  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) )
17 impexp 446 . . . . . . 7  |-  ( ( ( -.  p  =  q  /\  ( -.  p  .<_  W  /\  -.  q  .<_  W ) )  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) )  <-> 
( -.  p  =  q  ->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  ( ( p 
.\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) ) )
1816, 17bitri 249 . . . . . 6  |-  ( ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q
)  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) )  <-> 
( -.  p  =  q  ->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  ( ( p 
.\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) ) )
19 id 22 . . . . . . . . . 10  |-  ( p  =  q  ->  p  =  q )
20 fveq2 5872 . . . . . . . . . 10  |-  ( p  =  q  ->  ( F `  p )  =  ( F `  q ) )
2119, 20oveq12d 6313 . . . . . . . . 9  |-  ( p  =  q  ->  (
p  .\/  ( F `  p ) )  =  ( q  .\/  ( F `  q )
) )
2221oveq1d 6310 . . . . . . . 8  |-  ( p  =  q  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) )
2322a1d 25 . . . . . . 7  |-  ( p  =  q  ->  (
( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) ) )
24 pm2.61 171 . . . . . . 7  |-  ( ( p  =  q  -> 
( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) ) )  -> 
( ( -.  p  =  q  ->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  ( ( p 
.\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) )  ->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  ( ( p 
.\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) ) )
2523, 24ax-mp 5 . . . . . 6  |-  ( ( -.  p  =  q  ->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  ( ( p 
.\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) )  ->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  ( ( p 
.\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) )
2618, 25sylbi 195 . . . . 5  |-  ( ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q
)  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) )  ->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  ( ( p 
.\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) )
2710, 26impbii 188 . . . 4  |-  ( ( ( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) )  <->  ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q )  -> 
( ( p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) ) )
28272ralbii 2899 . . 3  |-  ( A. p  e.  A  A. q  e.  A  (
( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) )  <->  A. p  e.  A  A. q  e.  A  ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q )  -> 
( ( p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) ) )
2928anbi2i 694 . 2  |-  ( ( F  e.  D  /\  A. p  e.  A  A. q  e.  A  (
( -.  p  .<_  W  /\  -.  q  .<_  W )  ->  (
( p  .\/  ( F `  p )
)  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) ) )  <->  ( F  e.  D  /\  A. p  e.  A  A. q  e.  A  ( ( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q )  -> 
( ( p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q 
.\/  ( F `  q ) )  ./\  W ) ) ) )
308, 29syl6bb 261 1  |-  ( ( K  e.  B  /\  W  e.  H )  ->  ( F  e.  T  <->  ( F  e.  D  /\  A. p  e.  A  A. q  e.  A  (
( -.  p  .<_  W  /\  -.  q  .<_  W  /\  p  =/=  q
)  ->  ( (
p  .\/  ( F `  p ) )  ./\  W )  =  ( ( q  .\/  ( F `
 q ) ) 
./\  W ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767    =/= wne 2662   A.wral 2817   class class class wbr 4453   ` cfv 5594  (class class class)co 6295   lecple 14579   joincjn 15448   meetcmee 15449   Atomscatm 34416   LHypclh 35136   LDilcldil 35252   LTrncltrn 35253
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-rep 4564  ax-sep 4574  ax-nul 4582  ax-pr 4692
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2822  df-rex 2823  df-reu 2824  df-rab 2826  df-v 3120  df-sbc 3337  df-csb 3441  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-nul 3791  df-if 3946  df-sn 4034  df-pr 4036  df-op 4040  df-uni 4252  df-iun 4333  df-br 4454  df-opab 4512  df-mpt 4513  df-id 4801  df-xp 5011  df-rel 5012  df-cnv 5013  df-co 5014  df-dm 5015  df-rn 5016  df-res 5017  df-ima 5018  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-ov 6298  df-ltrn 35257
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator