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

Theorem dibelval2nd 42475
Description: Membership in value of the partial isomorphism B for a lattice 𝐾. (Contributed by NM, 13-Feb-2014.)
Hypotheses
Ref Expression
dibelval2nd.b 𝐵 = (Base‘𝐾)
dibelval2nd.l ≤ = (le‘𝐾)
dibelval2nd.h 𝐻 = (LHyp‘𝐾)
dibelval2nd.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
dibelval2nd.o 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))
dibelval2nd.i 𝐼 = ((DIsoB‘𝐾)‘𝑊)
Assertion
Ref Expression
dibelval2nd (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑋)) → (2nd ‘𝑌) = 0 )
Distinct variable groups:   𝑓,𝐾   𝑓,𝑊
Allowed substitution hints:   𝐵(𝑓)   𝑇(𝑓)   𝐻(𝑓)   𝐼(𝑓)   ≤ (𝑓)   𝑉(𝑓)   𝑋(𝑓)   𝑌(𝑓)   0 (𝑓)

Proof of Theorem dibelval2nd
StepHypRef Expression
1 dibelval2nd.b . . . . 5 𝐵 = (Base‘𝐾)
2 dibelval2nd.l . . . . 5 ≤ = (le‘𝐾)
3 dibelval2nd.h . . . . 5 𝐻 = (LHyp‘𝐾)
4 dibelval2nd.t . . . . 5 𝑇 = ((LTrn‘𝐾)‘𝑊)
5 dibelval2nd.o . . . . 5 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))
6 eqid 2763 . . . . 5 ((DIsoA‘𝐾)‘𝑊) = ((DIsoA‘𝐾)‘𝑊)
7 dibelval2nd.i . . . . 5 𝐼 = ((DIsoB‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7dibval2 42467 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }))
98eleq2d 2850 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑋) ↔ 𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 })))
109biimp3a 1499 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑋)) → 𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }))
11 xp2nd 8068 . 2 (𝑌 ∈ ((((DIsoA‘𝐾)‘𝑊)‘𝑋) × { 0 }) → (2nd ‘𝑌) ∈ { 0 })
12 elsni 4601 . 2 ((2nd ‘𝑌) ∈ { 0 } → (2nd ‘𝑌) = 0 )
1310, 11, 123syl 19 1 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑋)) → (2nd ‘𝑌) = 0 )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {csn 4588   class class class wbr 5108   ↦ cmpt 5192   I cid 5552   × cxp 5656   ↾ cres 5660  ‘cfv 6566  2nd c2nd 8034  Basecbs 17431  lecple 17479  LHypclh 41307  LTrncltrn 41424  DIsoAcdia 42351  DIsoBcdib 42461
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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-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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-2nd 8036  df-disoa 42352  df-dib 42462
This theorem is used by:  diblss  42493
  Copyright terms: Public domain W3C validator