Theorem atcvrj0 40465

Description: Two atoms covering the zero subspace are equal. (atcv1 32975 analog.) (Contributed by NM, 29-Nov-2011.)

Hypotheses

Ref	Expression
atcvrj0.b	⊢ 𝐵 = (Base‘𝐾)
atcvrj0.j	⊢ ∨ = (join‘𝐾)
atcvrj0.z	⊢ 0 = (0.‘𝐾)
atcvrj0.c	⊢ 𝐶 = ( ⋖ ‘𝐾)
atcvrj0.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
atcvrj0	⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑋 = 0 ↔ 𝑃 = 𝑄))

Proof of Theorem atcvrj0

Step	Hyp	Ref	Expression
1		breq1 5106	. . . . . . . 8 ⊢ (𝑋 = 0 → (𝑋𝐶(𝑃 ∨ 𝑄) ↔ 0 𝐶(𝑃 ∨ 𝑄)))
2	1	biimpd 232	. . . . . . 7 ⊢ (𝑋 = 0 → (𝑋𝐶(𝑃 ∨ 𝑄) → 0 𝐶(𝑃 ∨ 𝑄)))
3	2	adantl 487	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑋 = 0 ) → (𝑋𝐶(𝑃 ∨ 𝑄) → 0 𝐶(𝑃 ∨ 𝑄)))
4		atcvrj0.j	. . . . . . . . 9 ⊢ ∨ = (join‘𝐾)
5		atcvrj0.z	. . . . . . . . 9 ⊢ 0 = (0.‘𝐾)
6		atcvrj0.c	. . . . . . . . 9 ⊢ 𝐶 = ( ⋖ ‘𝐾)
7		atcvrj0.a	. . . . . . . . 9 ⊢ 𝐴 = (Atoms‘𝐾)
8	4, 5, 6, 7	atcvr0eq 40463	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄))
9	8	3adant3r1 1201	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄))
10	9	adantr 486	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑋 = 0 ) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄))
11	3, 10	sylibd 242	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑋 = 0 ) → (𝑋𝐶(𝑃 ∨ 𝑄) → 𝑃 = 𝑄))
12	11	ex 418	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 = 0 → (𝑋𝐶(𝑃 ∨ 𝑄) → 𝑃 = 𝑄)))
13	12	com23 87	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑃 ∨ 𝑄) → (𝑋 = 0 → 𝑃 = 𝑄)))
14	13	3impia 1135	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑋 = 0 → 𝑃 = 𝑄))
15		oveq1 7425	. . . . . . 7 ⊢ (𝑃 = 𝑄 → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑄))
16	15	breq2d 5115	. . . . . 6 ⊢ (𝑃 = 𝑄 → (𝑋𝐶(𝑃 ∨ 𝑄) ↔ 𝑋𝐶(𝑄 ∨ 𝑄)))
17	16	biimpac 484	. . . . 5 ⊢ ((𝑋𝐶(𝑃 ∨ 𝑄) ∧ 𝑃 = 𝑄) → 𝑋𝐶(𝑄 ∨ 𝑄))
18		simpr3 1215	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
19	4, 7	hlatjidm 40406	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄)
20	18, 19	syldan 603	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑄 ∨ 𝑄) = 𝑄)
21	20	breq2d 5115	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑄 ∨ 𝑄) ↔ 𝑋𝐶𝑄))
22		hlatl 40397	. . . . . . . . 9 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat)
23	22	adantr 486	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝐾 ∈ AtLat)
24		simpr1 1213	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑋 ∈ 𝐵)
25		atcvrj0.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐾)
26		eqid 2761	. . . . . . . . 9 ⊢ (le‘𝐾) = (le‘𝐾)
27	25, 26, 5, 6, 7	atcvreq0 40351	. . . . . . . 8 ⊢ ((𝐾 ∈ AtLat ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑋𝐶𝑄 ↔ 𝑋 = 0 ))
28	23, 24, 18, 27	syl3anc 1398	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶𝑄 ↔ 𝑋 = 0 ))
29	28	biimpd 232	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶𝑄 → 𝑋 = 0 ))
30	21, 29	sylbid 243	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑄 ∨ 𝑄) → 𝑋 = 0 ))
31	17, 30	syl5 35	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋𝐶(𝑃 ∨ 𝑄) ∧ 𝑃 = 𝑄) → 𝑋 = 0 ))
32	31	expd 421	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑃 ∨ 𝑄) → (𝑃 = 𝑄 → 𝑋 = 0 )))
33	32	3impia 1135	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑃 = 𝑄 → 𝑋 = 0 ))
34	14, 33	impbid 215	1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑋 = 0 ↔ 𝑃 = 𝑄))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5103  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  lecple 17428  joincjn 18478  0.cp0 18588   ⋖ ccvr 40299  Atomscatm 40300  AtLatcal 40301  HLchlt 40387

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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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 7375  df-ov 7421  df-oprab 7422  df-proset 18461  df-poset 18480  df-plt 18495  df-lub 18511  df-glb 18512  df-join 18513  df-meet 18514  df-p0 18590  df-lat 18599  df-clat 18666  df-oposet 40213  df-ol 40215  df-oml 40216  df-covers 40303  df-ats 40304  df-atl 40335  df-cvlat 40359  df-hlat 40388

This theorem is used by:  cvrat2  40466  atcvrneN  40467  atcvrj2b  40469