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

Theorem dicelval2N 42239
Description: Membership in value of the partial isomorphism C for a lattice 𝐾. (Contributed by NM, 25-Feb-2014.) (New usage is discouraged.)
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 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)
Assertion
Ref Expression
dicelval2N (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸))))
Distinct variable groups:   𝑔,𝐾   𝑇,𝑔   𝑔,𝑊   𝑄,𝑔
Allowed substitution hints:   𝐴(𝑔)   𝑃(𝑔)   𝐸(𝑔)   𝐺(𝑔)   𝐻(𝑔)   𝐼(𝑔)   ≤ (𝑔)   𝑉(𝑔)   𝑌(𝑔)

Proof of Theorem dicelval2N
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‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7dicelvalN 42235 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸))))
9 dicval2.g . . . . . 6 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)
109fveq2i 6888 . . . . 5 ((2nd ‘𝑌)‘𝐺) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))
1110eqeq2i 2774 . . . 4 ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ↔ (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
1211anbi1i 636 . . 3 (((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸) ↔ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸))
1312anbi2i 635 . 2 ((𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸)) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸)))
148, 13bitr4di 292 1 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸))))
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 3451   class class class wbr 5103   × cxp 5649  ‘cfv 6538  ℩crio 7376  1st c1st 7999  2nd c2nd 8000  lecple 17435  occoc 17436  Atomscatm 40320  LHypclh 41041  LTrncltrn 41158  TEndoctendo 41809  DIsoCcdic 42229
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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-1st 8001  df-2nd 8002  df-dic 42230
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator