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 39740
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 39352 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋𝑅 (𝑃 𝑄))) → (𝑅 𝑋𝑅 = 𝑃))
115, 10syld3an3 1410 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (𝑅 𝑋𝑅 = 𝑃))
1211necon3bbid 2968 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → (¬ 𝑅 𝑋𝑅𝑃))
131, 12mpbird 257 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → ¬ 𝑅 𝑋)
14 simp1l 1197 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ ((𝑅𝑃𝑅 (𝑃 𝑄)) ∧ (𝑃 𝑋 ∧ ¬ 𝑄 𝑋))) → 𝐾 ∈ HL)
15 hlatl 39307 . . . 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 39264 . . 3 ((𝐾 ∈ AtLat ∧ 𝑅𝐴𝑋𝐵) → (¬ 𝑅 𝑋 ↔ (𝑅 𝑋) = 0 ))
2216, 17, 18, 21syl3anc 1372 . 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 1086   = wceq 1539  wcel 2107  wne 2931   class class class wbr 5117  cfv 6528  (class class class)co 7400  Basecbs 17215  lecple 17265  joincjn 18310  meetcmee 18311  0.cp0 18420  Atomscatm 39210  AtLatcal 39211  HLchlt 39297
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5247  ax-sep 5264  ax-nul 5274  ax-pow 5333  ax-pr 5400  ax-un 7724
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3357  df-reu 3358  df-rab 3414  df-v 3459  df-sbc 3764  df-csb 3873  df-dif 3927  df-un 3929  df-in 3931  df-ss 3941  df-nul 4307  df-if 4499  df-pw 4575  df-sn 4600  df-pr 4602  df-op 4606  df-uni 4882  df-iun 4967  df-br 5118  df-opab 5180  df-mpt 5200  df-id 5546  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-riota 7357  df-ov 7403  df-oprab 7404  df-proset 18293  df-poset 18312  df-plt 18327  df-lub 18343  df-glb 18344  df-join 18345  df-meet 18346  df-p0 18422  df-lat 18429  df-covers 39213  df-ats 39214  df-atl 39245  df-cvlat 39269  df-hlat 39298
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator