Theorem 1cvrat 40174

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

Step	Hyp	Ref	Expression
1		hllat 40061	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
2	1	3ad2ant1 1149	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ Lat)
3		simp21 1223	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ∈ 𝐴)
4		1cvrat.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
5		1cvrat.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
6	4, 5	atbase 39987	. . . . . 6 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
7	3, 6	syl 18	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ∈ 𝐵)
8		simp22 1224	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ∈ 𝐴)
9	4, 5	atbase 39987	. . . . . 6 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
10	8, 9	syl 18	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ∈ 𝐵)
11		1cvrat.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
12	4, 11	latjcom 18503	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
13	2, 7, 10, 12	syl3anc 1396	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
14	13	oveq1d 7426	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) = ((𝑄 ∨ 𝑃) ∧ 𝑋))
15	4, 11	latjcl 18495	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → (𝑄 ∨ 𝑃) ∈ 𝐵)
16	2, 10, 7, 15	syl3anc 1396	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑄 ∨ 𝑃) ∈ 𝐵)
17		simp23 1225	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑋 ∈ 𝐵)
18		1cvrat.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
19	4, 18	latmcom 18519	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑄 ∨ 𝑃) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑄 ∨ 𝑃) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
20	2, 16, 17, 19	syl3anc 1396	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑄 ∨ 𝑃) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
21	14, 20	eqtrd 2804	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
22		simp1 1152	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ HL)
23	17, 8, 3	3jca 1144	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴))
24		simp31 1226	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ≠ 𝑄)
25	24	necomd 3019	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≠ 𝑃)
26		simp33 1228	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ¬ 𝑃 ≤ 𝑋)
27		hlop 40060	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP)
28	27	3ad2ant1 1149	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ OP)
29		1cvrat.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
30		1cvrat.u	. . . . . 6 ⊢ 1 = (1.‘𝐾)
31	4, 29, 30	ople1 39889	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑄 ∈ 𝐵) → 𝑄 ≤ 1 )
32	28, 10, 31	syl2anc 595	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≤ 1 )
33		simp32 1227	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑋𝐶 1 )
34		1cvrat.c	. . . . . 6 ⊢ 𝐶 = ( ⋖ ‘𝐾)
35	4, 29, 11, 30, 34, 5	1cvrjat 40173	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ (𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∨ 𝑃) = 1 )
36	22, 17, 3, 33, 26, 35	syl32anc 1403	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∨ 𝑃) = 1 )
37	32, 36	breqtrrd 5143	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≤ (𝑋 ∨ 𝑃))
38	4, 29, 11, 18, 5	cvrat3 40140	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴)) → ((𝑄 ≠ 𝑃 ∧ ¬ 𝑃 ≤ 𝑋 ∧ 𝑄 ≤ (𝑋 ∨ 𝑃)) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴))
39	38	imp 411	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴)) ∧ (𝑄 ≠ 𝑃 ∧ ¬ 𝑃 ≤ 𝑋 ∧ 𝑄 ≤ (𝑋 ∨ 𝑃))) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴)
40	22, 23, 25, 26, 37, 39	syl23anc 1402	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴)
41	21, 40	eqeltrd 2869	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) ∈ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149   ≠ wne 2964   class class class wbr 5113  ‘cfv 6537  (class class class)co 7411  Basecbs 17269  lecple 17317  joincjn 18367  meetcmee 18368  1.cp1 18478  Latclat 18487  OPcops 39870   ⋖ ccvr 39960  Atomscatm 39961  HLchlt 40048

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-proset 18350  df-poset 18369  df-plt 18384  df-lub 18400  df-glb 18401  df-join 18402  df-meet 18403  df-p0 18479  df-p1 18480  df-lat 18488  df-clat 18555  df-oposet 39874  df-ol 39876  df-oml 39877  df-covers 39964  df-ats 39965  df-atl 39996  df-cvlat 40020  df-hlat 40049

This theorem is referenced by:  cdlemblem  40491  cdlemb  40492  lhpat  40741