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 42279
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 2761 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑂 = 𝑂)
3 simp1 1154 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
4 simp1l 1216 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ HL)
54hllatd 40422 . . . 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 41056 . . . . 5 (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵)
117, 10syl 18 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐵)
12 dihjust.m . . . . 5 ∧ = (meet‘𝐾)
138, 12latmcl 18614 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ∈ 𝐵)
145, 6, 11, 13syl3anc 1398 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ∈ 𝐵)
15 dihjust.l . . . . 5 ≤ = (le‘𝐾)
168, 15, 12latmle2 18639 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ≤ 𝑊)
175, 6, 11, 16syl3anc 1398 . . 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 42206 . . 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 1569   ∈ wcel 2144  ⟨cop 4589   class class class wbr 5102   ↦ cmpt 5185   I cid 5544   ↾ cres 5652  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  lecple 17435  joincjn 18485  meetcmee 18486  Latclat 18605  LSSumclsm 19848  Atomscatm 40321  HLchlt 40408  LHypclh 41042  LTrncltrn 41159  trLctrl 41216  DVecHcdvh 42136  DIsoBcdib 42196  DIsoCcdic 42230
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-lub 18518  df-glb 18519  df-join 18520  df-meet 18521  df-lat 18606  df-atl 40356  df-cvlat 40380  df-hlat 40409  df-lhyp 41046  df-disoa 42087  df-dib 42197
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator