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 40016
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 1241 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → 𝑄𝑅)
21necomd 3011 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → 𝑅𝑄)
3 simpl1 1204 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → 𝐾 ∈ HL)
4 simpl23 1266 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → 𝑅𝐴)
5 simpl22 1265 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → 𝑄𝐴)
6 atcvrj1x.j . . . . . . . 8 = (join‘𝐾)
7 atcvrj1x.c . . . . . . . 8 𝐶 = ( ⋖ ‘𝐾)
8 atcvrj1x.a . . . . . . . 8 𝐴 = (Atoms‘𝐾)
96, 7, 8atcvr2 40002 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑅𝐴𝑄𝐴) → (𝑅𝑄𝑅𝐶(𝑄 𝑅)))
103, 4, 5, 9syl3anc 1389 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → (𝑅𝑄𝑅𝐶(𝑄 𝑅)))
112, 10mpbid 234 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → 𝑅𝐶(𝑄 𝑅))
12 breq1 5100 . . . . . 6 (𝑃 = 𝑅 → (𝑃𝐶(𝑄 𝑅) ↔ 𝑅𝐶(𝑄 𝑅)))
1312adantl 485 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → (𝑃𝐶(𝑄 𝑅) ↔ 𝑅𝐶(𝑄 𝑅)))
1411, 13mpbird 259 . . . 4 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃 = 𝑅) → 𝑃𝐶(𝑄 𝑅))
15 simpl1 1204 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃𝑅) → 𝐾 ∈ HL)
16 simpl2 1205 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃𝑅) → (𝑃𝐴𝑄𝐴𝑅𝐴))
17 simpr 488 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃𝑅) → 𝑃𝑅)
18 simpl3r 1242 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃𝑅) → 𝑃 (𝑄 𝑅))
19 atcvrj1x.l . . . . . 6 = (le‘𝐾)
2019, 6, 7, 8atcvrj1 40015 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑃𝑅𝑃 (𝑄 𝑅))) → 𝑃𝐶(𝑄 𝑅))
2115, 16, 17, 18, 20syl112anc 1392 . . . 4 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) ∧ 𝑃𝑅) → 𝑃𝐶(𝑄 𝑅))
2214, 21pm2.61dane 3043 . . 3 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑄𝑅𝑃 (𝑄 𝑅))) → 𝑃𝐶(𝑄 𝑅))
23223expia 1133 . 2 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) → ((𝑄𝑅𝑃 (𝑄 𝑅)) → 𝑃𝐶(𝑄 𝑅)))
24 hlatl 39944 . . . . . . 7 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2524ad2antrr 736 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝐾 ∈ AtLat)
26 simplr1 1228 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑃𝐴)
27 eqid 2761 . . . . . . 7 (0.‘𝐾) = (0.‘𝐾)
2827, 8atn0 39892 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐴) → 𝑃 ≠ (0.‘𝐾))
2925, 26, 28syl2anc 593 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑃 ≠ (0.‘𝐾))
30 simpll 776 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝐾 ∈ HL)
31 eqid 2761 . . . . . . . . 9 (Base‘𝐾) = (Base‘𝐾)
3231, 8atbase 39873 . . . . . . . 8 (𝑃𝐴𝑃 ∈ (Base‘𝐾))
3326, 32syl 17 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑃 ∈ (Base‘𝐾))
34 simplr2 1229 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑄𝐴)
35 simplr3 1230 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑅𝐴)
36 simpr 488 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑃𝐶(𝑄 𝑅))
3731, 6, 27, 7, 8atcvrj0 40012 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄𝐴𝑅𝐴) ∧ 𝑃𝐶(𝑄 𝑅)) → (𝑃 = (0.‘𝐾) ↔ 𝑄 = 𝑅))
3830, 33, 34, 35, 36, 37syl131anc 1401 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → (𝑃 = (0.‘𝐾) ↔ 𝑄 = 𝑅))
3938necon3bid 3000 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → (𝑃 ≠ (0.‘𝐾) ↔ 𝑄𝑅))
4029, 39mpbid 234 . . . 4 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑄𝑅)
41 hllat 39947 . . . . . . . 8 (𝐾 ∈ HL → 𝐾 ∈ Lat)
4241ad2antrr 736 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝐾 ∈ Lat)
4331, 8atbase 39873 . . . . . . . 8 (𝑄𝐴𝑄 ∈ (Base‘𝐾))
4434, 43syl 17 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑄 ∈ (Base‘𝐾))
4531, 8atbase 39873 . . . . . . . 8 (𝑅𝐴𝑅 ∈ (Base‘𝐾))
4635, 45syl 17 . . . . . . 7 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑅 ∈ (Base‘𝐾))
4731, 6latjcl 18461 . . . . . . 7 ((𝐾 ∈ Lat ∧ 𝑄 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) → (𝑄 𝑅) ∈ (Base‘𝐾))
4842, 44, 46, 47syl3anc 1389 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → (𝑄 𝑅) ∈ (Base‘𝐾))
4930, 33, 483jca 1140 . . . . 5 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → (𝐾 ∈ HL ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑄 𝑅) ∈ (Base‘𝐾)))
5031, 19, 7cvrle 39862 . . . . 5 (((𝐾 ∈ HL ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑄 𝑅) ∈ (Base‘𝐾)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑃 (𝑄 𝑅))
5149, 50sylancom 597 . . . 4 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → 𝑃 (𝑄 𝑅))
5240, 51jca 519 . . 3 (((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) ∧ 𝑃𝐶(𝑄 𝑅)) → (𝑄𝑅𝑃 (𝑄 𝑅)))
5352ex 416 . 2 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) → (𝑃𝐶(𝑄 𝑅) → (𝑄𝑅𝑃 (𝑄 𝑅))))
5423, 53impbid 214 1 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) → ((𝑄𝑅𝑃 (𝑄 𝑅)) ↔ 𝑃𝐶(𝑄 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1097   = wceq 1559  wcel 2141  wne 2956   class class class wbr 5097  cfv 6515  (class class class)co 7390  Basecbs 17235  lecple 17283  joincjn 18333  0.cp0 18443  Latclat 18453  ccvr 39846  Atomscatm 39847  AtLatcal 39848  HLchlt 39934
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-riota 7347  df-ov 7393  df-oprab 7394  df-proset 18316  df-poset 18335  df-plt 18350  df-lub 18366  df-glb 18367  df-join 18368  df-meet 18369  df-p0 18445  df-lat 18454  df-clat 18521  df-oposet 39760  df-ol 39762  df-oml 39763  df-covers 39850  df-ats 39851  df-atl 39882  df-cvlat 39906  df-hlat 39935
This theorem is referenced by:  atcvrj2  40017
  Copyright terms: Public domain W3C validator