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

Theorem lhpj1 41345
Description: The join of a co-atom (hyperplane) and an element not under it is the lattice unity. (Contributed by NM, 7-Dec-2012.)
Hypotheses
Ref Expression
lhpj1.b 𝐵 = (Base‘𝐾)
lhpj1.l ≤ = (le‘𝐾)
lhpj1.j ∨ = (join‘𝐾)
lhpj1.u 1 = (1.‘𝐾)
lhpj1.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
lhpj1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑊 ∨ 𝑋) = 1 )

Proof of Theorem lhpj1
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 simpll 779 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ HL)
2 simpr 490 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵)
3 lhpj1.b . . . . . 6 𝐵 = (Base‘𝐾)
4 lhpj1.h . . . . . 6 𝐻 = (LHyp‘𝐾)
53, 4lhpbase 41321 . . . . 5 (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵)
65ad2antlr 740 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → 𝑊 ∈ 𝐵)
7 lhpj1.l . . . . 5 ≤ = (le‘𝐾)
8 eqid 2763 . . . . 5 (Atoms‘𝐾) = (Atoms‘𝐾)
93, 7, 8hlrelat2 40726 . . . 4 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑊 ↔ ∃𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)))
101, 2, 6, 9syl3anc 1399 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑊 ↔ ∃𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)))
11 simp1l 1216 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
12 simp2 1155 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
13 simp3r 1221 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → ¬ 𝑝 ≤ 𝑊)
14 lhpj1.j . . . . . . . 8 ∨ = (join‘𝐾)
15 lhpj1.u . . . . . . . 8 1 = (1.‘𝐾)
167, 14, 15, 8, 4lhpjat1 41343 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑊 ∨ 𝑝) = 1 )
1711, 12, 13, 16syl12anc 850 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑊 ∨ 𝑝) = 1 )
18 simp3l 1220 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝑝 ≤ 𝑋)
19 simp1ll 1255 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝐾 ∈ HL)
2019hllatd 40687 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝐾 ∈ Lat)
213, 8atbase 40612 . . . . . . . . 9 (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ 𝐵)
22213ad2ant2 1152 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝑝 ∈ 𝐵)
23 simp1r 1217 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝑋 ∈ 𝐵)
2463ad2ant1 1151 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝑊 ∈ 𝐵)
253, 7, 14latjlej2 18678 . . . . . . . 8 ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵)) → (𝑝 ≤ 𝑋 → (𝑊 ∨ 𝑝) ≤ (𝑊 ∨ 𝑋)))
2620, 22, 23, 24, 25syl13anc 1400 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑝 ≤ 𝑋 → (𝑊 ∨ 𝑝) ≤ (𝑊 ∨ 𝑋)))
2718, 26mpd 16 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑊 ∨ 𝑝) ≤ (𝑊 ∨ 𝑋))
2817, 27eqbrtrrd 5135 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 1 ≤ (𝑊 ∨ 𝑋))
29 hlop 40685 . . . . . . 7 (𝐾 ∈ HL → 𝐾 ∈ OP)
3019, 29syl 18 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → 𝐾 ∈ OP)
313, 14latjcl 18663 . . . . . . 7 ((𝐾 ∈ Lat ∧ 𝑊 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑊 ∨ 𝑋) ∈ 𝐵)
3220, 24, 23, 31syl3anc 1399 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑊 ∨ 𝑋) ∈ 𝐵)
333, 7, 15op1le 40515 . . . . . 6 ((𝐾 ∈ OP ∧ (𝑊 ∨ 𝑋) ∈ 𝐵) → ( 1 ≤ (𝑊 ∨ 𝑋) ↔ (𝑊 ∨ 𝑋) = 1 ))
3430, 32, 33syl2anc 596 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → ( 1 ≤ (𝑊 ∨ 𝑋) ↔ (𝑊 ∨ 𝑋) = 1 ))
3528, 34mpbid 235 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ (𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑊 ∨ 𝑋) = 1 )
3635rexlimdv3a 3171 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → (∃𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 ∧ ¬ 𝑝 ≤ 𝑊) → (𝑊 ∨ 𝑋) = 1 ))
3710, 36sylbid 243 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑊 → (𝑊 ∨ 𝑋) = 1 ))
3837impr 460 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑊 ∨ 𝑋) = 1 )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  lecple 17479  joincjn 18535  1.cp1 18646  Latclat 18655  OPcops 40495  Atomscatm 40586  HLchlt 40673  LHypclh 41307
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-proset 18518  df-poset 18537  df-plt 18552  df-lub 18568  df-glb 18569  df-join 18570  df-meet 18571  df-p0 18647  df-p1 18648  df-lat 18656  df-clat 18723  df-oposet 40499  df-ol 40501  df-oml 40502  df-covers 40589  df-ats 40590  df-atl 40621  df-cvlat 40645  df-hlat 40674  df-lhyp 41311
This theorem is used by:  lhpmcvr  41346  cdleme30a  41701
  Copyright terms: Public domain W3C validator