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

Theorem dihmeetlem5 42556
Description: Part of proof that isomorphism H is order-preserving . (Contributed by NM, 6-Apr-2014.)
Hypotheses
Ref Expression
dihmeetlem5.b 𝐵 = (Base‘𝐾)
dihmeetlem5.l ≤ = (le‘𝐾)
dihmeetlem5.j ∨ = (join‘𝐾)
dihmeetlem5.m ∧ = (meet‘𝐾)
dihmeetlem5.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
dihmeetlem5 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → (𝑋 ∧ (𝑌 ∨ 𝑄)) = ((𝑋 ∧ 𝑌) ∨ 𝑄))

Proof of Theorem dihmeetlem5
StepHypRef Expression
1 simpl1 1210 . . 3 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → 𝐾 ∈ HL)
2 simprl 783 . . 3 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → 𝑄 ∈ 𝐴)
3 simpl2 1211 . . 3 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → 𝑋 ∈ 𝐵)
4 simpl3 1212 . . 3 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → 𝑌 ∈ 𝐵)
5 simprr 785 . . 3 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → 𝑄 ≤ 𝑋)
6 dihmeetlem5.b . . . 4 𝐵 = (Base‘𝐾)
7 dihmeetlem5.l . . . 4 ≤ = (le‘𝐾)
8 dihmeetlem5.j . . . 4 ∨ = (join‘𝐾)
9 dihmeetlem5.m . . . 4 ∧ = (meet‘𝐾)
10 dihmeetlem5.a . . . 4 𝐴 = (Atoms‘𝐾)
116, 7, 8, 9, 10atmod2i1 41109 . . 3 ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑄 ≤ 𝑋) → ((𝑋 ∧ 𝑌) ∨ 𝑄) = (𝑋 ∧ (𝑌 ∨ 𝑄)))
121, 2, 3, 4, 5, 11syl131anc 1411 . 2 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → ((𝑋 ∧ 𝑌) ∨ 𝑄) = (𝑋 ∧ (𝑌 ∨ 𝑄)))
1312eqcomd 2769 1 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑄 ∈ 𝐴 ∧ 𝑄 ≤ 𝑋)) → (𝑋 ∧ (𝑌 ∨ 𝑄)) = ((𝑋 ∧ 𝑌) ∨ 𝑄))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  lecple 17461  joincjn 18511  meetcmee 18512  Atomscatm 40511  HLchlt 40598
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 4839  df-uni 4871  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-proset 18494  df-poset 18513  df-plt 18528  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-p0 18623  df-lat 18632  df-clat 18699  df-oposet 40424  df-ol 40426  df-oml 40427  df-covers 40514  df-ats 40515  df-atl 40546  df-cvlat 40570  df-hlat 40599  df-psubsp 40751  df-pmap 40752  df-padd 41044
This theorem is used by:  dihmeetlem6  42557  dihjatc1  42559  dihmeetlem10N  42564
  Copyright terms: Public domain W3C validator