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

Theorem tendoex 37642
Description: Generalization of Lemma K of [Crawley] p. 118, cdlemk 37641. TODO: can this be used to shorten uses of cdlemk 37641? (Contributed by NM, 15-Oct-2013.)
Hypotheses
Ref Expression
tendoex.l = (le‘𝐾)
tendoex.h 𝐻 = (LHyp‘𝐾)
tendoex.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendoex.r 𝑅 = ((trL‘𝐾)‘𝑊)
tendoex.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
Assertion
Ref Expression
tendoex (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
Distinct variable groups:   𝑢,𝐸   𝑢,𝐹   𝑢,𝐾   𝑢,𝑁   𝑢,𝑅   𝑢,𝑇   𝑢,𝑊
Allowed substitution hints:   𝐻(𝑢)   (𝑢)

Proof of Theorem tendoex
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 simpl1l 1217 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → 𝐾 ∈ HL)
2 hlop 36029 . . . . . . 7 (𝐾 ∈ HL → 𝐾 ∈ OP)
31, 2syl 17 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → 𝐾 ∈ OP)
4 simpl1 1184 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
5 simpl2r 1220 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → 𝑁𝑇)
6 eqid 2795 . . . . . . . 8 (Base‘𝐾) = (Base‘𝐾)
7 tendoex.h . . . . . . . 8 𝐻 = (LHyp‘𝐾)
8 tendoex.t . . . . . . . 8 𝑇 = ((LTrn‘𝐾)‘𝑊)
9 tendoex.r . . . . . . . 8 𝑅 = ((trL‘𝐾)‘𝑊)
106, 7, 8, 9trlcl 36831 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝑁𝑇) → (𝑅𝑁) ∈ (Base‘𝐾))
114, 5, 10syl2anc 584 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → (𝑅𝑁) ∈ (Base‘𝐾))
12 simpr 485 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → (𝑅𝐹) ∈ (Atoms‘𝐾))
13 simpl3 1186 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → (𝑅𝑁) (𝑅𝐹))
14 tendoex.l . . . . . . 7 = (le‘𝐾)
15 eqid 2795 . . . . . . 7 (0.‘𝐾) = (0.‘𝐾)
16 eqid 2795 . . . . . . 7 (Atoms‘𝐾) = (Atoms‘𝐾)
176, 14, 15, 16leat 35960 . . . . . 6 (((𝐾 ∈ OP ∧ (𝑅𝑁) ∈ (Base‘𝐾) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) ∧ (𝑅𝑁) (𝑅𝐹)) → ((𝑅𝑁) = (𝑅𝐹) ∨ (𝑅𝑁) = (0.‘𝐾)))
183, 11, 12, 13, 17syl31anc 1366 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) ∈ (Atoms‘𝐾)) → ((𝑅𝑁) = (𝑅𝐹) ∨ (𝑅𝑁) = (0.‘𝐾)))
19 simp3 1131 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → (𝑅𝑁) (𝑅𝐹))
20 breq2 4966 . . . . . . . . 9 ((𝑅𝐹) = (0.‘𝐾) → ((𝑅𝑁) (𝑅𝐹) ↔ (𝑅𝑁) (0.‘𝐾)))
2119, 20syl5ibcom 246 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → ((𝑅𝐹) = (0.‘𝐾) → (𝑅𝑁) (0.‘𝐾)))
2221imp 407 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → (𝑅𝑁) (0.‘𝐾))
23 simpl1l 1217 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → 𝐾 ∈ HL)
2423, 2syl 17 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → 𝐾 ∈ OP)
25 simpl1 1184 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
26 simpl2r 1220 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → 𝑁𝑇)
2725, 26, 10syl2anc 584 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → (𝑅𝑁) ∈ (Base‘𝐾))
286, 14, 15ople0 35854 . . . . . . . 8 ((𝐾 ∈ OP ∧ (𝑅𝑁) ∈ (Base‘𝐾)) → ((𝑅𝑁) (0.‘𝐾) ↔ (𝑅𝑁) = (0.‘𝐾)))
2924, 27, 28syl2anc 584 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → ((𝑅𝑁) (0.‘𝐾) ↔ (𝑅𝑁) = (0.‘𝐾)))
3022, 29mpbid 233 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → (𝑅𝑁) = (0.‘𝐾))
3130olcd 871 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) ∧ (𝑅𝐹) = (0.‘𝐾)) → ((𝑅𝑁) = (𝑅𝐹) ∨ (𝑅𝑁) = (0.‘𝐾)))
32 simp1 1129 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
33 simp2l 1192 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → 𝐹𝑇)
3415, 16, 7, 8, 9trlator0 36838 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → ((𝑅𝐹) ∈ (Atoms‘𝐾) ∨ (𝑅𝐹) = (0.‘𝐾)))
3532, 33, 34syl2anc 584 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → ((𝑅𝐹) ∈ (Atoms‘𝐾) ∨ (𝑅𝐹) = (0.‘𝐾)))
3618, 31, 35mpjaodan 953 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → ((𝑅𝑁) = (𝑅𝐹) ∨ (𝑅𝑁) = (0.‘𝐾)))
37363expa 1111 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) (𝑅𝐹)) → ((𝑅𝑁) = (𝑅𝐹) ∨ (𝑅𝑁) = (0.‘𝐾)))
38 eqcom 2802 . . . . 5 ((𝑅𝑁) = (𝑅𝐹) ↔ (𝑅𝐹) = (𝑅𝑁))
39 tendoex.e . . . . . . 7 𝐸 = ((TEndo‘𝐾)‘𝑊)
407, 8, 9, 39cdlemk 37641 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝐹) = (𝑅𝑁)) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
41403expa 1111 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝐹) = (𝑅𝑁)) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
4238, 41sylan2b 593 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) = (𝑅𝐹)) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
43 eqid 2795 . . . . . . 7 (𝑇 ↦ ( I ↾ (Base‘𝐾))) = (𝑇 ↦ ( I ↾ (Base‘𝐾)))
446, 7, 8, 39, 43tendo0cl 37457 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑇 ↦ ( I ↾ (Base‘𝐾))) ∈ 𝐸)
4544ad2antrr 722 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) = (0.‘𝐾)) → (𝑇 ↦ ( I ↾ (Base‘𝐾))) ∈ 𝐸)
46 simplrl 773 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) = (0.‘𝐾)) → 𝐹𝑇)
4743, 6tendo02 37454 . . . . . . 7 (𝐹𝑇 → ((𝑇 ↦ ( I ↾ (Base‘𝐾)))‘𝐹) = ( I ↾ (Base‘𝐾)))
4846, 47syl 17 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) = (0.‘𝐾)) → ((𝑇 ↦ ( I ↾ (Base‘𝐾)))‘𝐹) = ( I ↾ (Base‘𝐾)))
496, 15, 7, 8, 9trlid0b 36845 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝑁𝑇) → (𝑁 = ( I ↾ (Base‘𝐾)) ↔ (𝑅𝑁) = (0.‘𝐾)))
5049adantrl 712 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) → (𝑁 = ( I ↾ (Base‘𝐾)) ↔ (𝑅𝑁) = (0.‘𝐾)))
5150biimpar 478 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) = (0.‘𝐾)) → 𝑁 = ( I ↾ (Base‘𝐾)))
5248, 51eqtr4d 2834 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) = (0.‘𝐾)) → ((𝑇 ↦ ( I ↾ (Base‘𝐾)))‘𝐹) = 𝑁)
53 fveq1 6537 . . . . . . 7 (𝑢 = (𝑇 ↦ ( I ↾ (Base‘𝐾))) → (𝑢𝐹) = ((𝑇 ↦ ( I ↾ (Base‘𝐾)))‘𝐹))
5453eqeq1d 2797 . . . . . 6 (𝑢 = (𝑇 ↦ ( I ↾ (Base‘𝐾))) → ((𝑢𝐹) = 𝑁 ↔ ((𝑇 ↦ ( I ↾ (Base‘𝐾)))‘𝐹) = 𝑁))
5554rspcev 3559 . . . . 5 (((𝑇 ↦ ( I ↾ (Base‘𝐾))) ∈ 𝐸 ∧ ((𝑇 ↦ ( I ↾ (Base‘𝐾)))‘𝐹) = 𝑁) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
5645, 52, 55syl2anc 584 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) = (0.‘𝐾)) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
5742, 56jaodan 952 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ ((𝑅𝑁) = (𝑅𝐹) ∨ (𝑅𝑁) = (0.‘𝐾))) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
5837, 57syldan 591 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇)) ∧ (𝑅𝑁) (𝑅𝐹)) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
59583impa 1103 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝑁𝑇) ∧ (𝑅𝑁) (𝑅𝐹)) → ∃𝑢𝐸 (𝑢𝐹) = 𝑁)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wo 842  w3a 1080   = wceq 1522  wcel 2081  wrex 3106   class class class wbr 4962  cmpt 5041   I cid 5347  cres 5445  cfv 6225  Basecbs 16312  lecple 16401  0.cp0 17476  OPcops 35839  Atomscatm 35930  HLchlt 36017  LHypclh 36651  LTrncltrn 36768  trLctrl 36825  TEndoctendo 37419
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5081  ax-sep 5094  ax-nul 5101  ax-pow 5157  ax-pr 5221  ax-un 7319  ax-riotaBAD 35620
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1525  df-fal 1535  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rmo 3113  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-nul 4212  df-if 4382  df-pw 4455  df-sn 4473  df-pr 4475  df-op 4479  df-uni 4746  df-iun 4827  df-iin 4828  df-br 4963  df-opab 5025  df-mpt 5042  df-id 5348  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233  df-riota 6977  df-ov 7019  df-oprab 7020  df-mpo 7021  df-1st 7545  df-2nd 7546  df-undef 7790  df-map 8258  df-proset 17367  df-poset 17385  df-plt 17397  df-lub 17413  df-glb 17414  df-join 17415  df-meet 17416  df-p0 17478  df-p1 17479  df-lat 17485  df-clat 17547  df-oposet 35843  df-ol 35845  df-oml 35846  df-covers 35933  df-ats 35934  df-atl 35965  df-cvlat 35989  df-hlat 36018  df-llines 36165  df-lplanes 36166  df-lvols 36167  df-lines 36168  df-psubsp 36170  df-pmap 36171  df-padd 36463  df-lhyp 36655  df-laut 36656  df-ldil 36771  df-ltrn 36772  df-trl 36826  df-tendo 37422
This theorem is referenced by:  dva1dim  37652  dihjatcclem4  38088
  Copyright terms: Public domain W3C validator