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 42158
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 42154 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑄) ↔ (𝐹 = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑆𝐸)))
11 dicval2.g . . . . 5 𝐺 = (𝑔𝑇 (𝑔𝑃) = 𝑄)
1211fveq2i 6876 . . . 4 (𝑆𝐺) = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄))
1312eqeq2i 2773 . . 3 (𝐹 = (𝑆𝐺) ↔ 𝐹 = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
1413anbi1i 636 . 2 ((𝐹 = (𝑆𝐺) ∧ 𝑆𝐸) ↔ (𝐹 = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑆𝐸))
1510, 14bitr4di 292 1 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑄) ↔ (𝐹 = (𝑆𝐺) ∧ 𝑆𝐸)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  Vcvv 3450  cop 4589   class class class wbr 5102  cfv 6527  crio 7364  lecple 17396  occoc 17397  Atomscatm 40240  LHypclh 40961  LTrncltrn 41078  TEndoctendo 41729  DIsoCcdic 42149
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 2100  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-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  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 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-dic 42150
This theorem is used by:  diclspsn  42171  cdlemn11a  42184  dihopelvalcqat  42223  dihopelvalcpre  42225  dihord6apre  42233
  Copyright terms: Public domain W3C validator