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

Theorem dicopelval2 41983
Description: Membership in value of the partial isomorphism C for a lattice 𝐾. (Contributed by NM, 20-Feb-2014.)
Hypotheses
Ref Expression
dicval.l = (le‘𝐾)
dicval.a 𝐴 = (Atoms‘𝐾)
dicval.h 𝐻 = (LHyp‘𝐾)
dicval.p 𝑃 = ((oc‘𝐾)‘𝑊)
dicval.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
dicval.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
dicval.i 𝐼 = ((DIsoC‘𝐾)‘𝑊)
dicval2.g 𝐺 = (𝑔𝑇 (𝑔𝑃) = 𝑄)
dicelval2.f 𝐹 ∈ V
dicelval2.s 𝑆 ∈ V
Assertion
Ref Expression
dicopelval2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑄) ↔ (𝐹 = (𝑆𝐺) ∧ 𝑆𝐸)))
Distinct variable groups:   𝑔,𝐾   𝑇,𝑔   𝑔,𝑊   𝑄,𝑔
Allowed substitution hints:   𝐴(𝑔)   𝑃(𝑔)   𝑆(𝑔)   𝐸(𝑔)   𝐹(𝑔)   𝐺(𝑔)   𝐻(𝑔)   𝐼(𝑔)   (𝑔)   𝑉(𝑔)

Proof of Theorem dicopelval2
StepHypRef Expression
1 dicval.l . . 3 = (le‘𝐾)
2 dicval.a . . 3 𝐴 = (Atoms‘𝐾)
3 dicval.h . . 3 𝐻 = (LHyp‘𝐾)
4 dicval.p . . 3 𝑃 = ((oc‘𝐾)‘𝑊)
5 dicval.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
6 dicval.e . . 3 𝐸 = ((TEndo‘𝐾)‘𝑊)
7 dicval.i . . 3 𝐼 = ((DIsoC‘𝐾)‘𝑊)
8 dicelval2.f . . 3 𝐹 ∈ V
9 dicelval2.s . . 3 𝑆 ∈ V
101, 2, 3, 4, 5, 6, 7, 8, 9dicopelval 41979 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑄) ↔ (𝐹 = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑆𝐸)))
11 dicval2.g . . . . 5 𝐺 = (𝑔𝑇 (𝑔𝑃) = 𝑄)
1211fveq2i 6884 . . . 4 (𝑆𝐺) = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄))
1312eqeq2i 2775 . . 3 (𝐹 = (𝑆𝐺) ↔ 𝐹 = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
1413anbi1i 635 . 2 ((𝐹 = (𝑆𝐺) ∧ 𝑆𝐸) ↔ (𝐹 = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑆𝐸))
1510, 14bitr4di 292 1 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑄) ↔ (𝐹 = (𝑆𝐺) ∧ 𝑆𝐸)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 400   = wceq 1569  wcel 2142  Vcvv 3454  cop 4594   class class class wbr 5108  cfv 6536  crio 7368  lecple 17323  occoc 17324  Atomscatm 40065  LHypclh 40786  LTrncltrn 40903  TEndoctendo 41554  DIsoCcdic 41974
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-dic 41975
This theorem is used by:  diclspsn  41996  cdlemn11a  42009  dihopelvalcqat  42048  dihopelvalcpre  42050  dihord6apre  42058
  Copyright terms: Public domain W3C validator