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

Theorem atcvrj2b 40457
Description: Condition for an atom to be covered by the join of two others. (Contributed by NM, 7-Feb-2012.)
Hypotheses
Ref Expression
atcvrj1x.l ≤ = (le‘𝐾)
atcvrj1x.j ∨ = (join‘𝐾)
atcvrj1x.c 𝐶 = ( ⋖ ‘𝐾)
atcvrj1x.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
atcvrj2b ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ((𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅)) ↔ 𝑃𝐶(𝑄 ∨ 𝑅)))

Proof of Theorem atcvrj2b
StepHypRef Expression
1 simpl3l 1247 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → 𝑄 ≠ 𝑅)
21necomd 3011 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → 𝑅 ≠ 𝑄)
3 simpl1 1210 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → 𝐾 ∈ HL)
4 simpl23 1272 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → 𝑅 ∈ 𝐴)
5 simpl22 1271 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → 𝑄 ∈ 𝐴)
6 atcvrj1x.j . . . . . . . 8 ∨ = (join‘𝐾)
7 atcvrj1x.c . . . . . . . 8 𝐶 = ( ⋖ ‘𝐾)
8 atcvrj1x.a . . . . . . . 8 𝐴 = (Atoms‘𝐾)
96, 7, 8atcvr2 40443 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑅 ≠ 𝑄 ↔ 𝑅𝐶(𝑄 ∨ 𝑅)))
103, 4, 5, 9syl3anc 1398 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → (𝑅 ≠ 𝑄 ↔ 𝑅𝐶(𝑄 ∨ 𝑅)))
112, 10mpbid 235 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → 𝑅𝐶(𝑄 ∨ 𝑅))
12 breq1 5106 . . . . . 6 (𝑃 = 𝑅 → (𝑃𝐶(𝑄 ∨ 𝑅) ↔ 𝑅𝐶(𝑄 ∨ 𝑅)))
1312adantl 487 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → (𝑃𝐶(𝑄 ∨ 𝑅) ↔ 𝑅𝐶(𝑄 ∨ 𝑅)))
1411, 13mpbird 260 . . . 4 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 = 𝑅) → 𝑃𝐶(𝑄 ∨ 𝑅))
15 simpl1 1210 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 ≠ 𝑅) → 𝐾 ∈ HL)
16 simpl2 1211 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 ≠ 𝑅) → (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴))
17 simpr 490 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 ≠ 𝑅) → 𝑃 ≠ 𝑅)
18 simpl3r 1248 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 ≠ 𝑅) → 𝑃 ≤ (𝑄 ∨ 𝑅))
19 atcvrj1x.l . . . . . 6 ≤ = (le‘𝐾)
2019, 6, 7, 8atcvrj1 40456 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) → 𝑃𝐶(𝑄 ∨ 𝑅))
2115, 16, 17, 18, 20syl112anc 1401 . . . 4 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) ∧ 𝑃 ≠ 𝑅) → 𝑃𝐶(𝑄 ∨ 𝑅))
2214, 21pm2.61dane 3043 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) → 𝑃𝐶(𝑄 ∨ 𝑅))
23223expia 1139 . 2 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ((𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃𝐶(𝑄 ∨ 𝑅)))
24 hlatl 40385 . . . . . . 7 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2524ad2antrr 739 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝐾 ∈ AtLat)
26 simplr1 1234 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ∈ 𝐴)
27 eqid 2761 . . . . . . 7 (0.‘𝐾) = (0.‘𝐾)
2827, 8atn0 40333 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → 𝑃 ≠ (0.‘𝐾))
2925, 26, 28syl2anc 596 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ≠ (0.‘𝐾))
30 simpll 779 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝐾 ∈ HL)
31 eqid 2761 . . . . . . . . 9 (Base‘𝐾) = (Base‘𝐾)
3231, 8atbase 40314 . . . . . . . 8 (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
3326, 32syl 18 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ∈ (Base‘𝐾))
34 simplr2 1235 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑄 ∈ 𝐴)
35 simplr3 1236 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑅 ∈ 𝐴)
36 simpr 490 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃𝐶(𝑄 ∨ 𝑅))
3731, 6, 27, 7, 8atcvrj0 40453 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑃 = (0.‘𝐾) ↔ 𝑄 = 𝑅))
3830, 33, 34, 35, 36, 37syl131anc 1410 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑃 = (0.‘𝐾) ↔ 𝑄 = 𝑅))
3938necon3bid 3000 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑃 ≠ (0.‘𝐾) ↔ 𝑄 ≠ 𝑅))
4029, 39mpbid 235 . . . 4 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑄 ≠ 𝑅)
41 hllat 40388 . . . . . . . 8 (𝐾 ∈ HL → 𝐾 ∈ Lat)
4241ad2antrr 739 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝐾 ∈ Lat)
4331, 8atbase 40314 . . . . . . . 8 (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
4434, 43syl 18 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑄 ∈ (Base‘𝐾))
4531, 8atbase 40314 . . . . . . . 8 (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾))
4635, 45syl 18 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑅 ∈ (Base‘𝐾))
4731, 6latjcl 18593 . . . . . . 7 ((𝐾 ∈ Lat ∧ 𝑄 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) → (𝑄 ∨ 𝑅) ∈ (Base‘𝐾))
4842, 44, 46, 47syl3anc 1398 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑄 ∨ 𝑅) ∈ (Base‘𝐾))
4930, 33, 483jca 1146 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝐾 ∈ HL ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)))
5031, 19, 7cvrle 40303 . . . . 5 (((𝐾 ∈ HL ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ≤ (𝑄 ∨ 𝑅))
5149, 50sylancom 600 . . . 4 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → 𝑃 ≤ (𝑄 ∨ 𝑅))
5240, 51jca 521 . . 3 (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) ∧ 𝑃𝐶(𝑄 ∨ 𝑅)) → (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅)))
5352ex 418 . 2 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → (𝑃𝐶(𝑄 ∨ 𝑅) → (𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))))
5423, 53impbid 215 1 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ((𝑄 ≠ 𝑅 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅)) ↔ 𝑃𝐶(𝑄 ∨ 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   class class class wbr 5103  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  lecple 17415  joincjn 18465  0.cp0 18575  Latclat 18585   ⋖ ccvr 40287  Atomscatm 40288  AtLatcal 40289  HLchlt 40375
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 7740
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 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-proset 18448  df-poset 18467  df-plt 18482  df-lub 18498  df-glb 18499  df-join 18500  df-meet 18501  df-p0 18577  df-lat 18586  df-clat 18653  df-oposet 40201  df-ol 40203  df-oml 40204  df-covers 40291  df-ats 40292  df-atl 40323  df-cvlat 40347  df-hlat 40376
This theorem is used by:  atcvrj2  40458
  Copyright terms: Public domain W3C validator