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

Theorem 1cvrat 40801
Description: Create an atom under an element covered by the lattice unity. Part of proof of Lemma B in [Crawley] p. 112. (Contributed by NM, 30-Apr-2012.)
Hypotheses
Ref Expression
1cvrat.b 𝐵 = (Base‘𝐾)
1cvrat.l ≤ = (le‘𝐾)
1cvrat.j ∨ = (join‘𝐾)
1cvrat.m ∧ = (meet‘𝐾)
1cvrat.u 1 = (1.‘𝐾)
1cvrat.c 𝐶 = ( ⋖ ‘𝐾)
1cvrat.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
1cvrat ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) ∈ 𝐴)

Proof of Theorem 1cvrat
StepHypRef Expression
1 hllat 40688 . . . . . 6 (𝐾 ∈ HL → 𝐾 ∈ Lat)
213ad2ant1 1152 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ Lat)
3 simp21 1227 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ∈ 𝐴)
4 1cvrat.b . . . . . . 7 𝐵 = (Base‘𝐾)
5 1cvrat.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
64, 5atbase 40614 . . . . . 6 (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
73, 6syl 18 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ∈ 𝐵)
8 simp22 1228 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ∈ 𝐴)
94, 5atbase 40614 . . . . . 6 (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
108, 9syl 18 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ∈ 𝐵)
11 1cvrat.j . . . . . 6 ∨ = (join‘𝐾)
124, 11latjcom 18673 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
132, 7, 10, 12syl3anc 1401 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
1413oveq1d 7465 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) = ((𝑄 ∨ 𝑃) ∧ 𝑋))
154, 11latjcl 18665 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → (𝑄 ∨ 𝑃) ∈ 𝐵)
162, 10, 7, 15syl3anc 1401 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑄 ∨ 𝑃) ∈ 𝐵)
17 simp23 1229 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑋 ∈ 𝐵)
18 1cvrat.m . . . . 5 ∧ = (meet‘𝐾)
194, 18latmcom 18689 . . . 4 ((𝐾 ∈ Lat ∧ (𝑄 ∨ 𝑃) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑄 ∨ 𝑃) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
202, 16, 17, 19syl3anc 1401 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑄 ∨ 𝑃) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
2114, 20eqtrd 2801 . 2 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
22 simp1 1155 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ HL)
2317, 8, 33jca 1147 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴))
24 simp31 1230 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ≠ 𝑄)
2524necomd 3017 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≠ 𝑃)
26 simp33 1232 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ¬ 𝑃 ≤ 𝑋)
27 hlop 40687 . . . . . 6 (𝐾 ∈ HL → 𝐾 ∈ OP)
28273ad2ant1 1152 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ OP)
29 1cvrat.l . . . . . 6 ≤ = (le‘𝐾)
30 1cvrat.u . . . . . 6 1 = (1.‘𝐾)
314, 29, 30ople1 40516 . . . . 5 ((𝐾 ∈ OP ∧ 𝑄 ∈ 𝐵) → 𝑄 ≤ 1 )
3228, 10, 31syl2anc 596 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≤ 1 )
33 simp32 1231 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑋𝐶 1 )
34 1cvrat.c . . . . . 6 𝐶 = ( ⋖ ‘𝐾)
354, 29, 11, 30, 34, 51cvrjat 40800 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ (𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∨ 𝑃) = 1 )
3622, 17, 3, 33, 26, 35syl32anc 1408 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∨ 𝑃) = 1 )
3732, 36breqtrrd 5138 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≤ (𝑋 ∨ 𝑃))
384, 29, 11, 18, 5cvrat3 40767 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴)) → ((𝑄 ≠ 𝑃 ∧ ¬ 𝑃 ≤ 𝑋 ∧ 𝑄 ≤ (𝑋 ∨ 𝑃)) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴))
3938imp 412 . . 3 (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴)) ∧ (𝑄 ≠ 𝑃 ∧ ¬ 𝑃 ≤ 𝑋 ∧ 𝑄 ≤ (𝑋 ∨ 𝑃))) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴)
4022, 23, 25, 26, 37, 39syl23anc 1407 . 2 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴)
4121, 40eqeltrd 2867 1 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) ∈ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150   ≠ wne 2962   class class class wbr 5107  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  lecple 17481  joincjn 18537  meetcmee 18538  1.cp1 18648  Latclat 18657  OPcops 40497   ⋖ ccvr 40587  Atomscatm 40588  HLchlt 40675
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-proset 18520  df-poset 18539  df-plt 18554  df-lub 18570  df-glb 18571  df-join 18572  df-meet 18573  df-p0 18649  df-p1 18650  df-lat 18658  df-clat 18725  df-oposet 40501  df-ol 40503  df-oml 40504  df-covers 40591  df-ats 40592  df-atl 40623  df-cvlat 40647  df-hlat 40676
This theorem is used by:  cdlemblem  41118  cdlemb  41119  lhpat  41368
  Copyright terms: Public domain W3C validator