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 37910
Description: Excluded middle law for closed projective subspaces, which can be shown to be equivalent to (and derivable from) the orthomodular law poml4N 37894. Lemma 3.3(2) in [Holland95] p. 215, which we prove as a special case of osumclN 37908. (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 763 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝐾 ∈ HL)
2 simplr 765 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝑋𝐴)
3 pexmid.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
4 pexmid.o . . . . . . 7 = (⊥𝑃𝐾)
53, 4polssatN 37849 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝐴) → ( 𝑋) ⊆ 𝐴)
65adantr 480 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( 𝑋) ⊆ 𝐴)
7 pexmid.p . . . . . 6 + = (+𝑃𝐾)
83, 7, 4poldmj1N 37869 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝐴 ∧ ( 𝑋) ⊆ 𝐴) → ( ‘(𝑋 + ( 𝑋))) = (( 𝑋) ∩ ( ‘( 𝑋))))
91, 2, 6, 8syl3anc 1369 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘(𝑋 + ( 𝑋))) = (( 𝑋) ∩ ( ‘( 𝑋))))
103, 4pnonsingN 37874 . . . . 5 ((𝐾 ∈ HL ∧ ( 𝑋) ⊆ 𝐴) → (( 𝑋) ∩ ( ‘( 𝑋))) = ∅)
111, 6, 10syl2anc 583 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (( 𝑋) ∩ ( ‘( 𝑋))) = ∅)
129, 11eqtrd 2778 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘(𝑋 + ( 𝑋))) = ∅)
1312fveq2d 6760 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘( ‘(𝑋 + ( 𝑋)))) = ( ‘∅))
14 simpr 484 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘( 𝑋)) = 𝑋)
15 eqid 2738 . . . . . . 7 (PSubCl‘𝐾) = (PSubCl‘𝐾)
163, 4, 15ispsubclN 37878 . . . . . 6 (𝐾 ∈ HL → (𝑋 ∈ (PSubCl‘𝐾) ↔ (𝑋𝐴 ∧ ( ‘( 𝑋)) = 𝑋)))
1716ad2antrr 722 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (𝑋 ∈ (PSubCl‘𝐾) ↔ (𝑋𝐴 ∧ ( ‘( 𝑋)) = 𝑋)))
182, 14, 17mpbir2and 709 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝑋 ∈ (PSubCl‘𝐾))
193, 4, 15polsubclN 37893 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝐴) → ( 𝑋) ∈ (PSubCl‘𝐾))
2019adantr 480 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( 𝑋) ∈ (PSubCl‘𝐾))
213, 42polssN 37856 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝐴) → 𝑋 ⊆ ( ‘( 𝑋)))
2221adantr 480 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → 𝑋 ⊆ ( ‘( 𝑋)))
237, 4, 15osumclN 37908 . . . 4 (((𝐾 ∈ HL ∧ 𝑋 ∈ (PSubCl‘𝐾) ∧ ( 𝑋) ∈ (PSubCl‘𝐾)) ∧ 𝑋 ⊆ ( ‘( 𝑋))) → (𝑋 + ( 𝑋)) ∈ (PSubCl‘𝐾))
241, 18, 20, 22, 23syl31anc 1371 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (𝑋 + ( 𝑋)) ∈ (PSubCl‘𝐾))
254, 15psubcli2N 37880 . . 3 ((𝐾 ∈ HL ∧ (𝑋 + ( 𝑋)) ∈ (PSubCl‘𝐾)) → ( ‘( ‘(𝑋 + ( 𝑋)))) = (𝑋 + ( 𝑋)))
261, 24, 25syl2anc 583 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘( ‘(𝑋 + ( 𝑋)))) = (𝑋 + ( 𝑋)))
273, 4pol0N 37850 . . 3 (𝐾 ∈ HL → ( ‘∅) = 𝐴)
2827ad2antrr 722 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → ( ‘∅) = 𝐴)
2913, 26, 283eqtr3d 2786 1 (((𝐾 ∈ HL ∧ 𝑋𝐴) ∧ ( ‘( 𝑋)) = 𝑋) → (𝑋 + ( 𝑋)) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  cin 3882  wss 3883  c0 4253  cfv 6418  (class class class)co 7255  Atomscatm 37204  HLchlt 37291  +𝑃cpadd 37736  𝑃cpolN 37843  PSubClcpscN 37875
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-riotaBAD 36894
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-undef 8060  df-proset 17928  df-poset 17946  df-plt 17963  df-lub 17979  df-glb 17980  df-join 17981  df-meet 17982  df-p0 18058  df-p1 18059  df-lat 18065  df-clat 18132  df-oposet 37117  df-ol 37119  df-oml 37120  df-covers 37207  df-ats 37208  df-atl 37239  df-cvlat 37263  df-hlat 37292  df-psubsp 37444  df-pmap 37445  df-padd 37737  df-polarityN 37844  df-psubclN 37876
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator