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

Theorem cdlemn3 42234
Description: Part of proof of Lemma N of [Crawley] p. 121 line 31. (Contributed by NM, 21-Feb-2014.)
Hypotheses
Ref Expression
cdlemn3.l ≤ = (le‘𝐾)
cdlemn3.a 𝐴 = (Atoms‘𝐾)
cdlemn3.p 𝑃 = ((oc‘𝐾)‘𝑊)
cdlemn3.h 𝐻 = (LHyp‘𝐾)
cdlemn3.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemn3.f 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)
cdlemn3.g 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅)
cdlemn3.j 𝐽 = (℩ℎ ∈ 𝑇 (ℎ‘𝑄) = 𝑅)
Assertion
Ref Expression
cdlemn3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐽 ∘ 𝐹) = 𝐺)
Distinct variable groups:   ≤ ,ℎ   𝐴,ℎ   ℎ,𝐻   ℎ,𝐾   𝑃,ℎ   𝑄,ℎ   𝑅,ℎ   𝑇,ℎ   ℎ,𝑊
Allowed substitution hints:   𝐹(ℎ)   𝐺(ℎ)   𝐽(ℎ)

Proof of Theorem cdlemn3
StepHypRef Expression
1 simp1 1154 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2 cdlemn3.l . . . . . . . . . 10 ≤ = (le‘𝐾)
3 cdlemn3.a . . . . . . . . . 10 𝐴 = (Atoms‘𝐾)
4 cdlemn3.h . . . . . . . . . 10 𝐻 = (LHyp‘𝐾)
5 cdlemn3.p . . . . . . . . . 10 𝑃 = ((oc‘𝐾)‘𝑊)
62, 3, 4, 5lhpocnel2 41056 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
763ad2ant1 1151 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
8 simp2 1155 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
9 cdlemn3.t . . . . . . . . 9 𝑇 = ((LTrn‘𝐾)‘𝑊)
10 cdlemn3.f . . . . . . . . 9 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)
112, 3, 4, 9, 10ltrniotacl 41616 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
121, 7, 8, 11syl3anc 1398 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
13 eqid 2761 . . . . . . . 8 (Base‘𝐾) = (Base‘𝐾)
1413, 4, 9ltrn1o 41161 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
151, 12, 14syl2anc 596 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
16 f1of 6822 . . . . . 6 (𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → 𝐹:(Base‘𝐾)⟶(Base‘𝐾))
1715, 16syl 18 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐹:(Base‘𝐾)⟶(Base‘𝐾))
187simpld 500 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
1913, 3atbase 40326 . . . . . 6 (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
2018, 19syl 18 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑃 ∈ (Base‘𝐾))
21 fvco3 6983 . . . . 5 ((𝐹:(Base‘𝐾)⟶(Base‘𝐾) ∧ 𝑃 ∈ (Base‘𝐾)) → ((𝐽 ∘ 𝐹)‘𝑃) = (𝐽‘(𝐹‘𝑃)))
2217, 20, 21syl2anc 596 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((𝐽 ∘ 𝐹)‘𝑃) = (𝐽‘(𝐹‘𝑃)))
232, 3, 4, 9, 10ltrniotaval 41618 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐹‘𝑃) = 𝑄)
241, 7, 8, 23syl3anc 1398 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐹‘𝑃) = 𝑄)
2524fveq2d 6887 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐽‘(𝐹‘𝑃)) = (𝐽‘𝑄))
26 cdlemn3.j . . . . 5 𝐽 = (℩ℎ ∈ 𝑇 (ℎ‘𝑄) = 𝑅)
272, 3, 4, 9, 26ltrniotaval 41618 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐽‘𝑄) = 𝑅)
2822, 25, 273eqtrd 2800 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((𝐽 ∘ 𝐹)‘𝑃) = 𝑅)
29 cdlemn3.g . . . . 5 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅)
302, 3, 4, 9, 29ltrniotaval 41618 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐺‘𝑃) = 𝑅)
317, 30syld3an2 1438 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐺‘𝑃) = 𝑅)
3228, 31eqtr4d 2799 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ((𝐽 ∘ 𝐹)‘𝑃) = (𝐺‘𝑃))
332, 3, 4, 9, 26ltrniotacl 41616 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐽 ∈ 𝑇)
344, 9ltrnco 41756 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐽 ∈ 𝑇 ∧ 𝐹 ∈ 𝑇) → (𝐽 ∘ 𝐹) ∈ 𝑇)
351, 33, 12, 34syl3anc 1398 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐽 ∘ 𝐹) ∈ 𝑇)
362, 3, 4, 9, 29ltrniotacl 41616 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
377, 36syld3an2 1438 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
382, 3, 4, 9ltrneq3 41245 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐽 ∘ 𝐹) ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐽 ∘ 𝐹)‘𝑃) = (𝐺‘𝑃) ↔ (𝐽 ∘ 𝐹) = 𝐺))
391, 35, 37, 7, 38syl121anc 1402 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (((𝐽 ∘ 𝐹)‘𝑃) = (𝐺‘𝑃) ↔ (𝐽 ∘ 𝐹) = 𝐺))
4032, 39mpbid 235 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐽 ∘ 𝐹) = 𝐺)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5103   ∘ ccom 5655  ⟶wf 6533  –1-1-onto→wf1o 6536  ‘cfv 6537  ℩crio 7374  Basecbs 17380  lecple 17428  occoc 17429  Atomscatm 40300  HLchlt 40387  LHypclh 41021  LTrncltrn 41138
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-riotaBAD 39990
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-undef 8283  df-map 8842  df-proset 18461  df-poset 18480  df-plt 18495  df-lub 18511  df-glb 18512  df-join 18513  df-meet 18514  df-p0 18590  df-p1 18591  df-lat 18599  df-clat 18666  df-oposet 40213  df-ol 40215  df-oml 40216  df-covers 40303  df-ats 40304  df-atl 40335  df-cvlat 40359  df-hlat 40388  df-llines 40535  df-lplanes 40536  df-lvols 40537  df-lines 40538  df-psubsp 40540  df-pmap 40541  df-padd 40833  df-lhyp 41025  df-laut 41026  df-ldil 41141  df-ltrn 41142  df-trl 41196
This theorem is used by:  cdlemn4  42235
  Copyright terms: Public domain W3C validator