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

Theorem pmodN 33590
Description: The modular law for projective subspaces. (Contributed by NM, 26-Mar-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
pmod.a  |-  A  =  ( Atoms `  K )
pmod.s  |-  S  =  ( PSubSp `  K )
pmod.p  |-  .+  =  ( +P `  K
)
Assertion
Ref Expression
pmodN  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( X  i^i  ( Y  .+  ( X  i^i  Z ) ) )  =  ( ( X  i^i  Y ) 
.+  ( X  i^i  Z ) ) )

Proof of Theorem pmodN
StepHypRef Expression
1 incom 3564 . 2  |-  ( X  i^i  ( ( X  i^i  Z )  .+  Y ) )  =  ( ( ( X  i^i  Z )  .+  Y )  i^i  X
)
2 hllat 33104 . . . . 5  |-  ( K  e.  HL  ->  K  e.  Lat )
32adantr 465 . . . 4  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  K  e.  Lat )
4 simpr2 995 . . . 4  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  Y  C_  A
)
5 inss2 3592 . . . . 5  |-  ( X  i^i  Z )  C_  Z
6 simpr3 996 . . . . 5  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  Z  C_  A
)
75, 6syl5ss 3388 . . . 4  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( X  i^i  Z )  C_  A )
8 pmod.a . . . . 5  |-  A  =  ( Atoms `  K )
9 pmod.p . . . . 5  |-  .+  =  ( +P `  K
)
108, 9paddcom 33553 . . . 4  |-  ( ( K  e.  Lat  /\  Y  C_  A  /\  ( X  i^i  Z )  C_  A )  ->  ( Y  .+  ( X  i^i  Z ) )  =  ( ( X  i^i  Z
)  .+  Y )
)
113, 4, 7, 10syl3anc 1218 . . 3  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( Y  .+  ( X  i^i  Z ) )  =  ( ( X  i^i  Z ) 
.+  Y ) )
1211ineq2d 3573 . 2  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( X  i^i  ( Y  .+  ( X  i^i  Z ) ) )  =  ( X  i^i  ( ( X  i^i  Z )  .+  Y ) ) )
13 incom 3564 . . . 4  |-  ( X  i^i  Y )  =  ( Y  i^i  X
)
1413oveq2i 6123 . . 3  |-  ( ( X  i^i  Z ) 
.+  ( X  i^i  Y ) )  =  ( ( X  i^i  Z
)  .+  ( Y  i^i  X ) )
15 inss2 3592 . . . . 5  |-  ( X  i^i  Y )  C_  Y
1615, 4syl5ss 3388 . . . 4  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( X  i^i  Y )  C_  A )
178, 9paddcom 33553 . . . 4  |-  ( ( K  e.  Lat  /\  ( X  i^i  Y ) 
C_  A  /\  ( X  i^i  Z )  C_  A )  ->  (
( X  i^i  Y
)  .+  ( X  i^i  Z ) )  =  ( ( X  i^i  Z )  .+  ( X  i^i  Y ) ) )
183, 16, 7, 17syl3anc 1218 . . 3  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( ( X  i^i  Y )  .+  ( X  i^i  Z ) )  =  ( ( X  i^i  Z ) 
.+  ( X  i^i  Y ) ) )
19 simpr1 994 . . . . 5  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  X  e.  S
)
207, 4, 193jca 1168 . . . 4  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( ( X  i^i  Z )  C_  A  /\  Y  C_  A  /\  X  e.  S
) )
21 inss1 3591 . . . . 5  |-  ( X  i^i  Z )  C_  X
22 pmod.s . . . . . 6  |-  S  =  ( PSubSp `  K )
238, 22, 9pmod1i 33588 . . . . 5  |-  ( ( K  e.  HL  /\  ( ( X  i^i  Z )  C_  A  /\  Y  C_  A  /\  X  e.  S ) )  -> 
( ( X  i^i  Z )  C_  X  ->  ( ( ( X  i^i  Z )  .+  Y )  i^i  X )  =  ( ( X  i^i  Z )  .+  ( Y  i^i  X ) ) ) )
2421, 23mpi 17 . . . 4  |-  ( ( K  e.  HL  /\  ( ( X  i^i  Z )  C_  A  /\  Y  C_  A  /\  X  e.  S ) )  -> 
( ( ( X  i^i  Z )  .+  Y )  i^i  X
)  =  ( ( X  i^i  Z ) 
.+  ( Y  i^i  X ) ) )
2520, 24syldan 470 . . 3  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( ( ( X  i^i  Z ) 
.+  Y )  i^i 
X )  =  ( ( X  i^i  Z
)  .+  ( Y  i^i  X ) ) )
2614, 18, 253eqtr4a 2501 . 2  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( ( X  i^i  Y )  .+  ( X  i^i  Z ) )  =  ( ( ( X  i^i  Z
)  .+  Y )  i^i  X ) )
271, 12, 263eqtr4a 2501 1  |-  ( ( K  e.  HL  /\  ( X  e.  S  /\  Y  C_  A  /\  Z  C_  A ) )  ->  ( X  i^i  ( Y  .+  ( X  i^i  Z ) ) )  =  ( ( X  i^i  Y ) 
.+  ( X  i^i  Z ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 965    = wceq 1369    e. wcel 1756    i^i cin 3348    C_ wss 3349   ` cfv 5439  (class class class)co 6112   Latclat 15236   Atomscatm 33004   HLchlt 33091   PSubSpcpsubsp 33236   +Pcpadd 33535
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4424  ax-sep 4434  ax-nul 4442  ax-pow 4491  ax-pr 4552  ax-un 6393
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2577  df-ne 2622  df-ral 2741  df-rex 2742  df-reu 2743  df-rab 2745  df-v 2995  df-sbc 3208  df-csb 3310  df-dif 3352  df-un 3354  df-in 3356  df-ss 3363  df-nul 3659  df-if 3813  df-pw 3883  df-sn 3899  df-pr 3901  df-op 3905  df-uni 4113  df-iun 4194  df-br 4314  df-opab 4372  df-mpt 4373  df-id 4657  df-xp 4867  df-rel 4868  df-cnv 4869  df-co 4870  df-dm 4871  df-rn 4872  df-res 4873  df-ima 4874  df-iota 5402  df-fun 5441  df-fn 5442  df-f 5443  df-f1 5444  df-fo 5445  df-f1o 5446  df-fv 5447  df-riota 6073  df-ov 6115  df-oprab 6116  df-mpt2 6117  df-1st 6598  df-2nd 6599  df-poset 15137  df-plt 15149  df-lub 15165  df-glb 15166  df-join 15167  df-meet 15168  df-p0 15230  df-lat 15237  df-covers 33007  df-ats 33008  df-atl 33039  df-cvlat 33063  df-hlat 33092  df-psubsp 33243  df-padd 33536
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator