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

Theorem cdlema2N 39749
Description: A condition for required for proof of Lemma A in [Crawley] p. 112. (Contributed by NM, 9-May-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlema2.b 𝐵 = (Base‘𝐾)
cdlema2.l = (le‘𝐾)
cdlema2.j = (join‘𝐾)
cdlema2.m = (meet‘𝐾)
cdlema2.z 0 = (0.‘𝐾)
cdlema2.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
cdlema2N (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (𝑅 𝑋) = 0 )

Proof of Theorem cdlema2N
StepHypRef Expression
1 simp3ll 1244 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑅𝑃)
2 simp3rl 1246 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑃 𝑋)
3 simp3rr 1247 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → ¬ 𝑄 𝑋)
4 simp3lr 1245 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑅 (𝑃 𝑄))
52, 3, 43jca 1128 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (𝑃 𝑋 ∧ ¬ 𝑄 𝑋𝑅 (𝑃 𝑄)))
6 cdlema2.b . . . . . 6 𝐵 = (Base‘𝐾)
7 cdlema2.l . . . . . 6 = (le‘𝐾)
8 cdlema2.j . . . . . 6 = (join‘𝐾)
9 cdlema2.a . . . . . 6 𝐴 = (Atoms‘𝐾)
106, 7, 8, 9exatleN 39361 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋𝑅 (𝑃 𝑄))) → (𝑅 𝑋𝑅 = 𝑃))
115, 10syld3an3 1409 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (𝑅 𝑋𝑅 = 𝑃))
1211necon3bbid 2984 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (¬ 𝑅 𝑋𝑅𝑃))
131, 12mpbird 257 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → ¬ 𝑅 𝑋)
14 simp1l 1197 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝐾 ∈ HL)
15 hlatl 39316 . . . 4 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
1614, 15syl 17 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝐾 ∈ AtLat)
17 simp23 1208 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑅𝐴)
18 simp1r 1198 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑋𝐵)
19 cdlema2.m . . . 4 = (meet‘𝐾)
20 cdlema2.z . . . 4 0 = (0.‘𝐾)
216, 7, 19, 20, 9atnle 39273 . . 3 ((𝐾 ∈ AtLat ∧ 𝑅𝐴𝑋𝐵) → (¬ 𝑅 𝑋 ↔ (𝑅 𝑋) = 0 ))
2216, 17, 18, 21syl3anc 1371 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (¬ 𝑅 𝑋 ↔ (𝑅 𝑋) = 0 ))
2313, 22mpbid 232 1 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (𝑅 𝑋) = 0 )
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  wcel 2108  wne 2946   class class class wbr 5166  cfv 6573  (class class class)co 7448  Basecbs 17258  lecple 17318  joincjn 18381  meetcmee 18382  0.cp0 18493  Atomscatm 39219  AtLatcal 39220  HLchlt 39306
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-proset 18365  df-poset 18383  df-plt 18400  df-lub 18416  df-glb 18417  df-join 18418  df-meet 18419  df-p0 18495  df-lat 18502  df-covers 39222  df-ats 39223  df-atl 39254  df-cvlat 39278  df-hlat 39307
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator