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 36321
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 1224 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑅𝑃)
2 simp3rl 1226 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑃 𝑋)
3 simp3rr 1227 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → ¬ 𝑄 𝑋)
4 simp3lr 1225 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑅 (𝑃 𝑄))
52, 3, 43jca 1108 . . . . 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 35933 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋𝑅 (𝑃 𝑄))) → (𝑅 𝑋𝑅 = 𝑃))
115, 10syld3an3 1389 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (𝑅 𝑋𝑅 = 𝑃))
1211necon3bbid 2998 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (¬ 𝑅 𝑋𝑅𝑃))
131, 12mpbird 249 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → ¬ 𝑅 𝑋)
14 simp1l 1177 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝐾 ∈ HL)
15 hlatl 35889 . . . 4 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
1614, 15syl 17 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝐾 ∈ AtLat)
17 simp23 1188 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑅𝐴)
18 simp1r 1178 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝑋𝐵)
19 cdlema2.m . . . 4 = (meet‘𝐾)
20 cdlema2.z . . . 4 0 = (0.‘𝐾)
216, 7, 19, 20, 9atnle 35846 . . 3 ((𝐾 ∈ AtLat ∧ 𝑅𝐴𝑋𝐵) → (¬ 𝑅 𝑋 ↔ (𝑅 𝑋) = 0 ))
2216, 17, 18, 21syl3anc 1351 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (¬ 𝑅 𝑋 ↔ (𝑅 𝑋) = 0 ))
2313, 22mpbid 224 1 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (𝑅 𝑋) = 0 )
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 387  w3a 1068   = wceq 1507  wcel 2048  wne 2961   class class class wbr 4923  cfv 6182  (class class class)co 6970  Basecbs 16329  lecple 16418  joincjn 17402  meetcmee 17403  0.cp0 17495  Atomscatm 35792  AtLatcal 35793  HLchlt 35879
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745  ax-rep 5043  ax-sep 5054  ax-nul 5061  ax-pow 5113  ax-pr 5180  ax-un 7273
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-mo 2544  df-eu 2580  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ne 2962  df-ral 3087  df-rex 3088  df-reu 3089  df-rab 3091  df-v 3411  df-sbc 3678  df-csb 3783  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-nul 4174  df-if 4345  df-pw 4418  df-sn 4436  df-pr 4438  df-op 4442  df-uni 4707  df-iun 4788  df-br 4924  df-opab 4986  df-mpt 5003  df-id 5305  df-xp 5406  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-rn 5411  df-res 5412  df-ima 5413  df-iota 6146  df-fun 6184  df-fn 6185  df-f 6186  df-f1 6187  df-fo 6188  df-f1o 6189  df-fv 6190  df-riota 6931  df-ov 6973  df-oprab 6974  df-proset 17386  df-poset 17404  df-plt 17416  df-lub 17432  df-glb 17433  df-join 17434  df-meet 17435  df-p0 17497  df-lat 17504  df-covers 35795  df-ats 35796  df-atl 35827  df-cvlat 35851  df-hlat 35880
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator