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

Theorem cdleme35sn2aw 39645
Description: Part of proof of Lemma E in [Crawley] p. 113. Show that f(x) is one-to-one outside of 𝑃 𝑄 line case; compare cdleme32sn2awN 39621. TODO: FIX COMMENT. (Contributed by NM, 18-Mar-2013.)
Hypotheses
Ref Expression
cdleme32s.b 𝐵 = (Base‘𝐾)
cdleme32s.l = (le‘𝐾)
cdleme32s.j = (join‘𝐾)
cdleme32s.m = (meet‘𝐾)
cdleme32s.a 𝐴 = (Atoms‘𝐾)
cdleme32s.h 𝐻 = (LHyp‘𝐾)
cdleme32s.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme32s.d 𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
cdleme32s.n 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐷)
Assertion
Ref Expression
cdleme35sn2aw ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑅 / 𝑠𝑁𝑆 / 𝑠𝑁)
Distinct variable groups:   𝐴,𝑠   𝐵,𝑠   𝐻,𝑠   ,𝑠   𝐾,𝑠   ,𝑠   ,𝑠   𝑃,𝑠   𝑄,𝑠   𝑅,𝑠   𝑆,𝑠   𝑈,𝑠   𝑊,𝑠
Allowed substitution hints:   𝐷(𝑠)   𝐼(𝑠)   𝑁(𝑠)

Proof of Theorem cdleme35sn2aw
StepHypRef Expression
1 cdleme32s.l . . 3 = (le‘𝐾)
2 cdleme32s.j . . 3 = (join‘𝐾)
3 cdleme32s.m . . 3 = (meet‘𝐾)
4 cdleme32s.a . . 3 𝐴 = (Atoms‘𝐾)
5 cdleme32s.h . . 3 𝐻 = (LHyp‘𝐾)
6 cdleme32s.u . . 3 𝑈 = ((𝑃 𝑄) 𝑊)
7 eqid 2731 . . 3 ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊)))
8 eqid 2731 . . 3 ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))) = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
91, 2, 3, 4, 5, 6, 7, 8cdleme35h2 39644 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))) ≠ ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))))
10 simp22l 1291 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑅𝐴)
11 simp31 1208 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → ¬ 𝑅 (𝑃 𝑄))
12 cdleme32s.d . . . 4 𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
13 cdleme32s.n . . . 4 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐷)
1412, 13, 7cdleme31sn2 39576 . . 3 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
1510, 11, 14syl2anc 583 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑅 / 𝑠𝑁 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
16 simp23l 1293 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑆𝐴)
17 simp32 1209 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → ¬ 𝑆 (𝑃 𝑄))
1812, 13, 8cdleme31sn2 39576 . . 3 ((𝑆𝐴 ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝑆 / 𝑠𝑁 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))))
1916, 17, 18syl2anc 583 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑆 / 𝑠𝑁 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))))
209, 15, 193netr4d 3017 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑅 / 𝑠𝑁𝑆 / 𝑠𝑁)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2105  wne 2939  csb 3893  ifcif 4528   class class class wbr 5148  cfv 6543  (class class class)co 7412  Basecbs 17151  lecple 17211  joincjn 18271  meetcmee 18272  Atomscatm 38449  HLchlt 38536  LHypclh 39171
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7729
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3375  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-iin 5000  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7368  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7979  df-2nd 7980  df-proset 18255  df-poset 18273  df-plt 18290  df-lub 18306  df-glb 18307  df-join 18308  df-meet 18309  df-p0 18385  df-p1 18386  df-lat 18392  df-clat 18459  df-oposet 38362  df-ol 38364  df-oml 38365  df-covers 38452  df-ats 38453  df-atl 38484  df-cvlat 38508  df-hlat 38537  df-lines 38688  df-psubsp 38690  df-pmap 38691  df-padd 38983  df-lhyp 39175
This theorem is referenced by:  cdleme41snaw  39663
  Copyright terms: Public domain W3C validator