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

Theorem dihord2cN 42469
Description: Part of proof after Lemma N of [Crawley] p. 122. Reverse ordering property. TODO: needed? shorten other proof with it? (Contributed by NM, 3-Mar-2014.) (New usage is discouraged.)
Hypotheses
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 ↾ 𝐵))
Assertion
Ref Expression
dihord2cN (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → ⟨𝑓, 𝑂⟩ ∈ (𝐼‘(𝑋 ∧ 𝑊)))
Distinct variable groups:   ∨ ,𝑓   ∧ ,𝑓   ⊕ ,𝑓   𝑓,ℎ,𝐴   𝑓,𝐼   𝑓,𝐽   𝑅,𝑓   𝐵,𝑓,ℎ   𝑓,𝐻,ℎ   𝑓,𝐾,ℎ   ≤ ,𝑓,ℎ   𝑇,𝑓,ℎ   𝑓,𝑊,ℎ   𝑓,𝑋
Allowed substitution hints:   ⊕ (ℎ)   𝑅(ℎ)   𝑈(𝑓, ℎ)   𝐼(ℎ)   𝐽(ℎ)   ∨ (ℎ)   ∧ (ℎ)   𝑂(𝑓, ℎ)   𝑋(ℎ)

Proof of Theorem dihord2cN
StepHypRef Expression
1 simp3 1156 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)))
2 eqidd 2764 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑂 = 𝑂)
3 simp1 1154 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
4 simp1l 1216 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ HL)
54hllatd 40612 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ Lat)
6 simp2 1155 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑋 ∈ 𝐵)
7 simp1r 1217 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐻)
8 dihjust.b . . . . . 6 𝐵 = (Base‘𝐾)
9 dihjust.h . . . . . 6 𝐻 = (LHyp‘𝐾)
108, 9lhpbase 41246 . . . . 5 (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵)
117, 10syl 18 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐵)
12 dihjust.m . . . . 5 ∧ = (meet‘𝐾)
138, 12latmcl 18640 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ∈ 𝐵)
145, 6, 11, 13syl3anc 1399 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ∈ 𝐵)
15 dihjust.l . . . . 5 ≤ = (le‘𝐾)
168, 15, 12latmle2 18665 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ≤ 𝑊)
175, 6, 11, 16syl3anc 1399 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ≤ 𝑊)
18 dihord2c.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
19 dihord2c.r . . . 4 𝑅 = ((trL‘𝐾)‘𝑊)
20 dihord2c.o . . . 4 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
21 dihjust.i . . . 4 𝐼 = ((DIsoB‘𝐾)‘𝑊)
228, 15, 9, 18, 19, 20, 21dibopelval3 42396 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑋 ∧ 𝑊) ∈ 𝐵 ∧ (𝑋 ∧ 𝑊) ≤ 𝑊)) → (⟨𝑓, 𝑂⟩ ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂)))
233, 14, 17, 22syl12anc 850 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (⟨𝑓, 𝑂⟩ ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂)))
241, 2, 23mpbir2and 726 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → ⟨𝑓, 𝑂⟩ ∈ (𝐼‘(𝑋 ∧ 𝑊)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ⟨cop 4838   class class class wbr 5106   ↦ cmpt 5189   I cid 5549   ↾ cres 5657  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  lecple 17461  joincjn 18511  meetcmee 18512  Latclat 18631  LSSumclsm 19875  Atomscatm 40511  HLchlt 40598  LHypclh 41232  LTrncltrn 41349  trLctrl 41406  DVecHcdvh 42326  DIsoBcdib 42386  DIsoCcdic 42420
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-lat 18632  df-atl 40546  df-cvlat 40570  df-hlat 40599  df-lhyp 41236  df-disoa 42277  df-dib 42387
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator