Theorem 1cvrat 40724

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 40611	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
2	1	3ad2ant1 1151	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ Lat)
3		simp21 1225	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ∈ 𝐴)
4		1cvrat.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
5		1cvrat.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
6	4, 5	atbase 40537	. . . . . 6 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
7	3, 6	syl 18	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ∈ 𝐵)
8		simp22 1226	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ∈ 𝐴)
9	4, 5	atbase 40537	. . . . . 6 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
10	8, 9	syl 18	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ∈ 𝐵)
11		1cvrat.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
12	4, 11	latjcom 18647	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
13	2, 7, 10, 12	syl3anc 1399	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
14	13	oveq1d 7455	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) = ((𝑄 ∨ 𝑃) ∧ 𝑋))
15	4, 11	latjcl 18639	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → (𝑄 ∨ 𝑃) ∈ 𝐵)
16	2, 10, 7, 15	syl3anc 1399	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑄 ∨ 𝑃) ∈ 𝐵)
17		simp23 1227	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑋 ∈ 𝐵)
18		1cvrat.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
19	4, 18	latmcom 18663	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑄 ∨ 𝑃) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑄 ∨ 𝑃) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
20	2, 16, 17, 19	syl3anc 1399	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑄 ∨ 𝑃) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
21	14, 20	eqtrd 2798	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) = (𝑋 ∧ (𝑄 ∨ 𝑃)))
22		simp1 1154	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ HL)
23	17, 8, 3	3jca 1146	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴))
24		simp31 1228	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑃 ≠ 𝑄)
25	24	necomd 3014	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≠ 𝑃)
26		simp33 1230	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ¬ 𝑃 ≤ 𝑋)
27		hlop 40610	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP)
28	27	3ad2ant1 1151	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝐾 ∈ OP)
29		1cvrat.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
30		1cvrat.u	. . . . . 6 ⊢ 1 = (1.‘𝐾)
31	4, 29, 30	ople1 40439	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑄 ∈ 𝐵) → 𝑄 ≤ 1 )
32	28, 10, 31	syl2anc 596	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≤ 1 )
33		simp32 1229	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑋𝐶 1 )
34		1cvrat.c	. . . . . 6 ⊢ 𝐶 = ( ⋖ ‘𝐾)
35	4, 29, 11, 30, 34, 5	1cvrjat 40723	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ (𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∨ 𝑃) = 1 )
36	22, 17, 3, 33, 26, 35	syl32anc 1406	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∨ 𝑃) = 1 )
37	32, 36	breqtrrd 5136	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → 𝑄 ≤ (𝑋 ∨ 𝑃))
38	4, 29, 11, 18, 5	cvrat3 40690	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴)) → ((𝑄 ≠ 𝑃 ∧ ¬ 𝑃 ≤ 𝑋 ∧ 𝑄 ≤ (𝑋 ∨ 𝑃)) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴))
39	38	imp 412	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴)) ∧ (𝑄 ≠ 𝑃 ∧ ¬ 𝑃 ≤ 𝑋 ∧ 𝑄 ≤ (𝑋 ∨ 𝑃))) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴)
40	22, 23, 25, 26, 37, 39	syl23anc 1405	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → (𝑋 ∧ (𝑄 ∨ 𝑃)) ∈ 𝐴)
41	21, 40	eqeltrd 2864	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≠ 𝑄 ∧ 𝑋𝐶 1 ∧ ¬ 𝑃 ≤ 𝑋)) → ((𝑃 ∨ 𝑄) ∧ 𝑋) ∈ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  lecple 17461  joincjn 18511  meetcmee 18512  1.cp1 18622  Latclat 18631  OPcops 40420   ⋖ ccvr 40510  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-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-proset 18494  df-poset 18513  df-plt 18528  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-p0 18623  df-p1 18624  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

This theorem is used by:  cdlemblem  41041  cdlemb  41042  lhpat  41291