![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dihord10 | Structured version Visualization version GIF version |
Description: Part of proof after Lemma N of [Crawley] p. 122. Reverse ordering property. (Contributed by NM, 3-Mar-2014.) |
Ref | Expression |
---|---|
dihjust.b | ⊢ 𝐵 = (Base‘𝐾) |
dihjust.l | ⊢ ≤ = (le‘𝐾) |
dihjust.j | ⊢ ∨ = (join‘𝐾) |
dihjust.m | ⊢ ∧ = (meet‘𝐾) |
dihjust.a | ⊢ 𝐴 = (Atoms‘𝐾) |
dihjust.h | ⊢ 𝐻 = (LHyp‘𝐾) |
dihjust.i | ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) |
dihjust.J | ⊢ 𝐽 = ((DIsoC‘𝐾)‘𝑊) |
dihjust.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
dihjust.s | ⊢ ⊕ = (LSSum‘𝑈) |
dihord2c.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
dihord2c.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
dihord2c.o | ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) |
dihord2.p | ⊢ 𝑃 = ((oc‘𝐾)‘𝑊) |
dihord2.e | ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) |
dihord2.d | ⊢ + = (+g‘𝑈) |
dihord2.g | ⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑁) |
Ref | Expression |
---|---|
dihord10 | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝑅‘𝑓) ≤ (𝑌 ∧ 𝑊)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp11 1204 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
2 | simp12 1205 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) | |
3 | simp13 1206 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) | |
4 | simp31l 1297 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → 𝑠 ∈ 𝐸) | |
5 | simp31r 1298 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → 𝑔 ∈ 𝑇) | |
6 | simp33 1212 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉)) | |
7 | dihjust.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
8 | dihjust.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
9 | dihjust.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
10 | dihjust.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
11 | dihord2.p | . . . . . 6 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊) | |
12 | dihord2c.o | . . . . . 6 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) | |
13 | dihord2c.t | . . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
14 | dihord2.e | . . . . . 6 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) | |
15 | dihjust.u | . . . . . 6 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) | |
16 | dihord2.d | . . . . . 6 ⊢ + = (+g‘𝑈) | |
17 | dihord2.g | . . . . . 6 ⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑁) | |
18 | 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 | dihordlem7b 39609 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝑓 = 𝑔 ∧ 𝑂 = 𝑠)) |
19 | 18 | simpld 496 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇 ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → 𝑓 = 𝑔) |
20 | 1, 2, 3, 4, 5, 6, 19 | syl123anc 1388 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → 𝑓 = 𝑔) |
21 | 20 | fveq2d 6842 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝑅‘𝑓) = (𝑅‘𝑔)) |
22 | simp32 1211 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊)) | |
23 | 21, 22 | eqbrtrd 5126 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ ((𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇) ∧ (𝑅‘𝑔) ≤ (𝑌 ∧ 𝑊) ∧ 〈𝑓, 𝑂〉 = (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉))) → (𝑅‘𝑓) ≤ (𝑌 ∧ 𝑊)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 〈cop 4591 class class class wbr 5104 ↦ cmpt 5187 I cid 5528 ↾ cres 5633 ‘cfv 6492 ℩crio 7305 (class class class)co 7350 Basecbs 17019 +gcplusg 17069 lecple 17076 occoc 17077 joincjn 18136 meetcmee 18137 LSSumclsm 19351 Atomscatm 37656 HLchlt 37743 LHypclh 38378 LTrncltrn 38495 trLctrl 38552 TEndoctendo 39146 DVecHcdvh 39472 DIsoBcdib 39532 DIsoCcdic 39566 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2709 ax-rep 5241 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7663 ax-cnex 11041 ax-resscn 11042 ax-1cn 11043 ax-icn 11044 ax-addcl 11045 ax-addrcl 11046 ax-mulcl 11047 ax-mulrcl 11048 ax-mulcom 11049 ax-addass 11050 ax-mulass 11051 ax-distr 11052 ax-i2m1 11053 ax-1ne0 11054 ax-1rid 11055 ax-rnegex 11056 ax-rrecex 11057 ax-cnre 11058 ax-pre-lttri 11059 ax-pre-lttrn 11060 ax-pre-ltadd 11061 ax-pre-mulgt0 11062 ax-riotaBAD 37346 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-pss 3928 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4865 df-iun 4955 df-iin 4956 df-br 5105 df-opab 5167 df-mpt 5188 df-tr 5222 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6250 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6444 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7306 df-ov 7353 df-oprab 7354 df-mpo 7355 df-om 7794 df-1st 7912 df-2nd 7913 df-undef 8172 df-frecs 8180 df-wrecs 8211 df-recs 8285 df-rdg 8324 df-1o 8380 df-er 8582 df-map 8701 df-en 8818 df-dom 8819 df-sdom 8820 df-fin 8821 df-pnf 11125 df-mnf 11126 df-xr 11127 df-ltxr 11128 df-le 11129 df-sub 11321 df-neg 11322 df-nn 12088 df-2 12150 df-3 12151 df-4 12152 df-5 12153 df-6 12154 df-n0 12348 df-z 12434 df-uz 12698 df-fz 13355 df-struct 16955 df-slot 16990 df-ndx 17002 df-base 17020 df-plusg 17082 df-mulr 17083 df-sca 17085 df-vsca 17086 df-proset 18120 df-poset 18138 df-plt 18155 df-lub 18171 df-glb 18172 df-join 18173 df-meet 18174 df-p0 18250 df-p1 18251 df-lat 18257 df-clat 18324 df-oposet 37569 df-ol 37571 df-oml 37572 df-covers 37659 df-ats 37660 df-atl 37691 df-cvlat 37715 df-hlat 37744 df-llines 37892 df-lplanes 37893 df-lvols 37894 df-lines 37895 df-psubsp 37897 df-pmap 37898 df-padd 38190 df-lhyp 38382 df-laut 38383 df-ldil 38498 df-ltrn 38499 df-trl 38553 df-tendo 39149 df-edring 39151 df-dvech 39473 |
This theorem is referenced by: dihord2pre 39619 |
Copyright terms: Public domain | W3C validator |