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 36239
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 36215. 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 2806 . . 3 ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))) = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊)))
8 eqid 2806 . . 3 ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))) = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
91, 2, 3, 4, 5, 6, 7, 8cdleme35h2 36238 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))) ≠ ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))))
10 simp22l 1384 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑅𝐴)
11 simp31 1259 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → ¬ 𝑅 (𝑃 𝑄))
12 cdleme32s.d . . . 4 𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
13 cdleme32s.n . . . 4 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐷)
1412, 13, 7cdleme31sn2 36170 . . 3 ((𝑅𝐴 ∧ ¬ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠𝑁 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
1510, 11, 14syl2anc 575 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑅 / 𝑠𝑁 = ((𝑅 𝑈) (𝑄 ((𝑃 𝑅) 𝑊))))
16 simp23l 1386 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑆𝐴)
17 simp32 1260 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → ¬ 𝑆 (𝑃 𝑄))
1812, 13, 8cdleme31sn2 36170 . . 3 ((𝑆𝐴 ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝑆 / 𝑠𝑁 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))))
1916, 17, 18syl2anc 575 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑆 / 𝑠𝑁 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊))))
209, 15, 193netr4d 3055 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆)) → 𝑅 / 𝑠𝑁𝑆 / 𝑠𝑁)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  w3a 1100   = wceq 1637  wcel 2156  wne 2978  csb 3728  ifcif 4279   class class class wbr 4844  cfv 6101  (class class class)co 6874  Basecbs 16068  lecple 16160  joincjn 17149  meetcmee 17150  Atomscatm 35043  HLchlt 35130  LHypclh 35764
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-8 2158  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784  ax-rep 4964  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5096  ax-un 7179
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-eu 2634  df-mo 2635  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ne 2979  df-ral 3101  df-rex 3102  df-reu 3103  df-rab 3105  df-v 3393  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4117  df-if 4280  df-pw 4353  df-sn 4371  df-pr 4373  df-op 4377  df-uni 4631  df-iun 4714  df-iin 4715  df-br 4845  df-opab 4907  df-mpt 4924  df-id 5219  df-xp 5317  df-rel 5318  df-cnv 5319  df-co 5320  df-dm 5321  df-rn 5322  df-res 5323  df-ima 5324  df-iota 6064  df-fun 6103  df-fn 6104  df-f 6105  df-f1 6106  df-fo 6107  df-f1o 6108  df-fv 6109  df-riota 6835  df-ov 6877  df-oprab 6878  df-mpt2 6879  df-1st 7398  df-2nd 7399  df-proset 17133  df-poset 17151  df-plt 17163  df-lub 17179  df-glb 17180  df-join 17181  df-meet 17182  df-p0 17244  df-p1 17245  df-lat 17251  df-clat 17313  df-oposet 34956  df-ol 34958  df-oml 34959  df-covers 35046  df-ats 35047  df-atl 35078  df-cvlat 35102  df-hlat 35131  df-lines 35281  df-psubsp 35283  df-pmap 35284  df-padd 35576  df-lhyp 35768
This theorem is referenced by:  cdleme41snaw  36257
  Copyright terms: Public domain W3C validator