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

Theorem pexmidN 37265
Description: Excluded middle law for closed projective subspaces, which can be shown to be equivalent to (and derivable from) the orthomodular law poml4N 37249. Lemma 3.3(2) in [Holland95] p. 215, which we prove as a special case of osumclN 37263. (Contributed by NM, 25-Mar-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
pexmid.a 𝐴 = (Atoms‘𝐾)
pexmid.p + = (+𝑃𝐾)
pexmid.o = (⊥𝑃𝐾)
Assertion
Ref Expression
pexmidN (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (𝑋 + ( 𝑋)) = 𝐴)

Proof of Theorem pexmidN
StepHypRef Expression
1 simpll 766 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝐾 ∈ HL)
2 simplr 768 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝑋𝐴)
3 pexmid.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
4 pexmid.o . . . . . . 7 = (⊥𝑃𝐾)
53, 4polssatN 37204 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝐴) → ( 𝑋) ⊆ 𝐴)
65adantr 484 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( 𝑋) ⊆ 𝐴)
7 pexmid.p . . . . . 6 + = (+𝑃𝐾)
83, 7, 4poldmj1N 37224 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝐴 ∧ ( 𝑋) ⊆ 𝐴) → ( ‘(𝑋 + ( 𝑋))) = (( 𝑋) ∩ ( ‘( 𝑋))))
91, 2, 6, 8syl3anc 1368 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘(𝑋 + ( 𝑋))) = (( 𝑋) ∩ ( ‘( 𝑋))))
103, 4pnonsingN 37229 . . . . 5 ((𝐾 ∈ HL ∧ ( 𝑋) ⊆ 𝐴) → (( 𝑋) ∩ ( ‘( 𝑋))) = ∅)
111, 6, 10syl2anc 587 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (( 𝑋) ∩ ( ‘( 𝑋))) = ∅)
129, 11eqtrd 2833 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘(𝑋 + ( 𝑋))) = ∅)
1312fveq2d 6649 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘( ‘(𝑋 + ( 𝑋)))) = ( ‘∅))
14 simpr 488 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘( 𝑋)) = 𝑋)
15 eqid 2798 . . . . . . 7 (PSubCl‘𝐾) = (PSubCl‘𝐾)
163, 4, 15ispsubclN 37233 . . . . . 6 (𝐾 ∈ HL → (𝑋 ∈ (PSubCl‘𝐾) ↔ (𝑋𝐴 ∧ ( ‘( 𝑋)) = 𝑋)))
1716ad2antrr 725 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (𝑋 ∈ (PSubCl‘𝐾) ↔ (𝑋𝐴 ∧ ( ‘( 𝑋)) = 𝑋)))
182, 14, 17mpbir2and 712 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝑋 ∈ (PSubCl‘𝐾))
193, 4, 15polsubclN 37248 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝐴) → ( 𝑋) ∈ (PSubCl‘𝐾))
2019adantr 484 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( 𝑋) ∈ (PSubCl‘𝐾))
213, 42polssN 37211 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝐴) → 𝑋 ⊆ ( ‘( 𝑋)))
2221adantr 484 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝑋 ⊆ ( ‘( 𝑋)))
237, 4, 15osumclN 37263 . . . 4 (((𝐾 ∈ HL ∧ 𝑋 ∈ (PSubCl‘𝐾) ∧ ( 𝑋) ∈ (PSubCl‘𝐾)) ∧ 𝑋 ⊆ ( ‘( 𝑋))) → (𝑋 + ( 𝑋)) ∈ (PSubCl‘𝐾))
241, 18, 20, 22, 23syl31anc 1370 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (𝑋 + ( 𝑋)) ∈ (PSubCl‘𝐾))
254, 15psubcli2N 37235 . . 3 ((𝐾 ∈ HL ∧ (𝑋 + ( 𝑋)) ∈ (PSubCl‘𝐾)) → ( ‘( ‘(𝑋 + ( 𝑋)))) = (𝑋 + ( 𝑋)))
261, 24, 25syl2anc 587 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘( ‘(𝑋 + ( 𝑋)))) = (𝑋 + ( 𝑋)))
273, 4pol0N 37205 . . 3 (𝐾 ∈ HL → ( ‘∅) = 𝐴)
2827ad2antrr 725 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘∅) = 𝐴)
2913, 26, 283eqtr3d 2841 1 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (𝑋 + ( 𝑋)) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  cin 3880  wss 3881  c0 4243  cfv 6324  (class class class)co 7135  Atomscatm 36559  HLchlt 36646  +𝑃cpadd 37091  𝑃cpolN 37198  PSubClcpscN 37230
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-riotaBAD 36249
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-undef 7922  df-proset 17530  df-poset 17548  df-plt 17560  df-lub 17576  df-glb 17577  df-join 17578  df-meet 17579  df-p0 17641  df-p1 17642  df-lat 17648  df-clat 17710  df-oposet 36472  df-ol 36474  df-oml 36475  df-covers 36562  df-ats 36563  df-atl 36594  df-cvlat 36618  df-hlat 36647  df-psubsp 36799  df-pmap 36800  df-padd 37092  df-polarityN 37199  df-psubclN 37231
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator