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

Theorem dihmeetlem17N 42300
Description: Lemma for isomorphism H of a lattice meet. (Contributed by NM, 7-Apr-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
dihmeetlem14.b 𝐵 = (Base‘𝐾)
dihmeetlem14.l ≤ = (le‘𝐾)
dihmeetlem14.h 𝐻 = (LHyp‘𝐾)
dihmeetlem14.j ∨ = (join‘𝐾)
dihmeetlem14.m ∧ = (meet‘𝐾)
dihmeetlem14.a 𝐴 = (Atoms‘𝐾)
dihmeetlem14.u 𝑈 = ((DVecH‘𝐾)‘𝑊)
dihmeetlem14.s ⊕ = (LSSum‘𝑈)
dihmeetlem14.i 𝐼 = ((DIsoH‘𝐾)‘𝑊)
dihmeetlem17.o 0 = (0.‘𝐾)
Assertion
Ref Expression
dihmeetlem17N ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝑌 ∧ 𝑝) = 0 )

Proof of Theorem dihmeetlem17N
StepHypRef Expression
1 simpl1l 1243 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → 𝐾 ∈ HL)
21hllatd 40341 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → 𝐾 ∈ Lat)
3 simpl3l 1247 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → 𝑝 ∈ 𝐴)
4 dihmeetlem14.b . . . . 5 𝐵 = (Base‘𝐾)
5 dihmeetlem14.a . . . . 5 𝐴 = (Atoms‘𝐾)
64, 5atbase 40266 . . . 4 (𝑝 ∈ 𝐴 → 𝑝 ∈ 𝐵)
73, 6syl 18 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → 𝑝 ∈ 𝐵)
8 simpr1 1213 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → 𝑌 ∈ 𝐵)
9 dihmeetlem14.m . . . 4 ∧ = (meet‘𝐾)
104, 9latmcom 18599 . . 3 ((𝐾 ∈ Lat ∧ 𝑝 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑝 ∧ 𝑌) = (𝑌 ∧ 𝑝))
112, 7, 8, 10syl3anc 1398 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝑝 ∧ 𝑌) = (𝑌 ∧ 𝑝))
12 simpl1 1210 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
13 simpl2 1211 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))
14 simpl3 1212 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊))
15 simpr2 1214 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝑋 ∧ 𝑌) ≤ 𝑊)
16 simpr3 1215 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → 𝑝 ≤ 𝑋)
17 dihmeetlem14.l . . . . 5 ≤ = (le‘𝐾)
18 dihmeetlem14.j . . . . 5 ∨ = (join‘𝐾)
19 dihmeetlem14.h . . . . 5 𝐻 = (LHyp‘𝐾)
204, 17, 18, 9, 5, 19lhpmcvr4N 41003 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → ¬ 𝑝 ≤ 𝑌)
2112, 13, 14, 8, 15, 16, 20syl123anc 1414 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → ¬ 𝑝 ≤ 𝑌)
22 hlatl 40337 . . . . 5 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
231, 22syl 18 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → 𝐾 ∈ AtLat)
24 dihmeetlem17.o . . . . 5 0 = (0.‘𝐾)
254, 17, 9, 24, 5atnle 40294 . . . 4 ((𝐾 ∈ AtLat ∧ 𝑝 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑝 ≤ 𝑌 ↔ (𝑝 ∧ 𝑌) = 0 ))
2623, 3, 8, 25syl3anc 1398 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (¬ 𝑝 ≤ 𝑌 ↔ (𝑝 ∧ 𝑌) = 0 ))
2721, 26mpbid 235 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝑝 ∧ 𝑌) = 0 )
2811, 27eqtr3d 2797 1 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) ∧ (𝑌 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ≤ 𝑊 ∧ 𝑝 ≤ 𝑋)) → (𝑌 ∧ 𝑝) = 0 )
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 2145   class class class wbr 5102  ‘cfv 6527  (class class class)co 7408  Basecbs 17349  lecple 17397  joincjn 18447  meetcmee 18448  0.cp0 18557  Latclat 18567  LSSumclsm 19810  Atomscatm 40240  AtLatcal 40241  HLchlt 40327  LHypclh 40961  DVecHcdvh 42055  DIsoHcdih 42205
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-proset 18430  df-poset 18449  df-plt 18464  df-lub 18480  df-glb 18481  df-join 18482  df-meet 18483  df-p0 18559  df-lat 18568  df-covers 40243  df-ats 40244  df-atl 40275  df-cvlat 40299  df-hlat 40328  df-lhyp 40965
This theorem is used by:  dihmeetlem18N  42301
  Copyright terms: Public domain W3C validator