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

Theorem cdlemg2jlemOLDN 34899
 Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: FIX COMMENT. f preserves join: f(r ∨ s) = f(r) ∨ s, p. 115 10th line from bottom. TODO: Combine with cdlemg2jOLDN 34904? (Contributed by NM, 22-Apr-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemg2.b 𝐵 = (Base‘𝐾)
cdlemg2.l = (le‘𝐾)
cdlemg2.j = (join‘𝐾)
cdlemg2.m = (meet‘𝐾)
cdlemg2.a 𝐴 = (Atoms‘𝐾)
cdlemg2.h 𝐻 = (LHyp‘𝐾)
cdlemg2.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg2ex.u 𝑈 = ((𝑝 𝑞) 𝑊)
cdlemg2ex.d 𝐷 = ((𝑡 𝑈) (𝑞 ((𝑝 𝑡) 𝑊)))
cdlemg2ex.e 𝐸 = ((𝑝 𝑞) (𝐷 ((𝑠 𝑡) 𝑊)))
cdlemg2ex.g 𝐺 = (𝑥𝐵 ↦ if((𝑝𝑞 ∧ ¬ 𝑥 𝑊), (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑝 𝑞), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
Assertion
Ref Expression
cdlemg2jlemOLDN (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝐹𝑇) → (𝐹‘(𝑃 𝑄)) = ((𝐹𝑃) (𝐹𝑄)))
Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,𝐴   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   𝑞,𝑝,𝐴   𝐹,𝑝,𝑞   𝐻,𝑝,𝑞   𝐾,𝑝,𝑞   ,𝑝,𝑞   𝑇,𝑝,𝑞   𝑊,𝑝,𝑞,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑝,𝑞   𝑃,𝑝,𝑞   𝑄,𝑝,𝑞
Allowed substitution hints:   𝐵(𝑞,𝑝)   𝐷(𝑡,𝑞,𝑝)   𝑇(𝑥,𝑦,𝑧,𝑡,𝑠)   𝑈(𝑞,𝑝)   𝐸(𝑡,𝑠,𝑞,𝑝)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐺(𝑥,𝑦,𝑧,𝑡,𝑠,𝑞,𝑝)   (𝑞,𝑝)

Proof of Theorem cdlemg2jlemOLDN
StepHypRef Expression
1 cdlemg2.b . . 3 𝐵 = (Base‘𝐾)
2 cdlemg2.l . . 3 = (le‘𝐾)
3 cdlemg2.j . . 3 = (join‘𝐾)
4 cdlemg2.m . . 3 = (meet‘𝐾)
5 cdlemg2.a . . 3 𝐴 = (Atoms‘𝐾)
6 cdlemg2.h . . 3 𝐻 = (LHyp‘𝐾)
7 cdlemg2.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
8 cdlemg2ex.u . . 3 𝑈 = ((𝑝 𝑞) 𝑊)
9 cdlemg2ex.d . . 3 𝐷 = ((𝑡 𝑈) (𝑞 ((𝑝 𝑡) 𝑊)))
10 cdlemg2ex.e . . 3 𝐸 = ((𝑝 𝑞) (𝐷 ((𝑠 𝑡) 𝑊)))
11 cdlemg2ex.g . . 3 𝐺 = (𝑥𝐵 ↦ if((𝑝𝑞 ∧ ¬ 𝑥 𝑊), (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑝 𝑞), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
12 fveq1 6102 . . . 4 (𝐹 = 𝐺 → (𝐹‘(𝑃 𝑄)) = (𝐺‘(𝑃 𝑄)))
13 fveq1 6102 . . . . 5 (𝐹 = 𝐺 → (𝐹𝑃) = (𝐺𝑃))
14 fveq1 6102 . . . . 5 (𝐹 = 𝐺 → (𝐹𝑄) = (𝐺𝑄))
1513, 14oveq12d 6567 . . . 4 (𝐹 = 𝐺 → ((𝐹𝑃) (𝐹𝑄)) = ((𝐺𝑃) (𝐺𝑄)))
1612, 15eqeq12d 2625 . . 3 (𝐹 = 𝐺 → ((𝐹‘(𝑃 𝑄)) = ((𝐹𝑃) (𝐹𝑄)) ↔ (𝐺‘(𝑃 𝑄)) = ((𝐺𝑃) (𝐺𝑄))))
17 vex 3176 . . . . 5 𝑠 ∈ V
18 eqid 2610 . . . . . 6 ((𝑠 𝑈) (𝑞 ((𝑝 𝑠) 𝑊))) = ((𝑠 𝑈) (𝑞 ((𝑝 𝑠) 𝑊)))
199, 18cdleme31sc 34690 . . . . 5 (𝑠 ∈ V → 𝑠 / 𝑡𝐷 = ((𝑠 𝑈) (𝑞 ((𝑝 𝑠) 𝑊))))
2017, 19ax-mp 5 . . . 4 𝑠 / 𝑡𝐷 = ((𝑠 𝑈) (𝑞 ((𝑝 𝑠) 𝑊)))
21 eqid 2610 . . . 4 (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸)) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸))
22 eqid 2610 . . . 4 if(𝑠 (𝑝 𝑞), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) = if(𝑠 (𝑝 𝑞), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷)
23 eqid 2610 . . . 4 (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑝 𝑞), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))) = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑝 𝑞), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑝 𝑞)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊))))
241, 2, 3, 4, 5, 6, 8, 20, 9, 10, 21, 22, 23, 11cdleme42mgN 34794 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝𝐴 ∧ ¬ 𝑝 𝑊) ∧ (𝑞𝐴 ∧ ¬ 𝑞 𝑊)) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))) → (𝐺‘(𝑃 𝑄)) = ((𝐺𝑃) (𝐺𝑄)))
251, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 16, 24cdlemg2ce 34898 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))) → (𝐹‘(𝑃 𝑄)) = ((𝐹𝑃) (𝐹𝑄)))
26253com23 1263 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝐹𝑇) → (𝐹‘(𝑃 𝑄)) = ((𝐹𝑃) (𝐹𝑄)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  Vcvv 3173  ⦋csb 3499  ifcif 4036   class class class wbr 4583   ↦ cmpt 4643  ‘cfv 5804  ℩crio 6510  (class class class)co 6549  Basecbs 15695  lecple 15775  joincjn 16767  meetcmee 16768  Atomscatm 33568  HLchlt 33655  LHypclh 34288  LTrncltrn 34405 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-riotaBAD 33257 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-iin 4458  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-undef 7286  df-map 7746  df-preset 16751  df-poset 16769  df-plt 16781  df-lub 16797  df-glb 16798  df-join 16799  df-meet 16800  df-p0 16862  df-p1 16863  df-lat 16869  df-clat 16931  df-oposet 33481  df-ol 33483  df-oml 33484  df-covers 33571  df-ats 33572  df-atl 33603  df-cvlat 33627  df-hlat 33656  df-llines 33802  df-lplanes 33803  df-lvols 33804  df-lines 33805  df-psubsp 33807  df-pmap 33808  df-padd 34100  df-lhyp 34292  df-laut 34293  df-ldil 34408  df-ltrn 34409  df-trl 34464 This theorem is referenced by:  cdlemg2jOLDN  34904
 Copyright terms: Public domain W3C validator