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 42041
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 42037 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼𝑄) ↔ (𝐹 = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑆𝐸)))
11 dicval2.g . . . . 5 𝐺 = (𝑔𝑇 (𝑔𝑃) = 𝑄)
1211fveq2i 6885 . . . 4 (𝑆𝐺) = (𝑆‘(𝑔𝑇 (𝑔𝑃) = 𝑄))
1312eqeq2i 2775 . . 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 3453  cop 4593   class class class wbr 5107  cfv 6537  crio 7372  lecple 17353  occoc 17354  Atomscatm 40123  LHypclh 40844  LTrncltrn 40961  TEndoctendo 41612  DIsoCcdic 42032
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
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 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 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-dic 42033
This theorem is used by:  diclspsn  42054  cdlemn11a  42067  dihopelvalcqat  42106  dihopelvalcpre  42108  dihord6apre  42116
  Copyright terms: Public domain W3C validator