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

Theorem dicelval1sta 36476
Description: Membership in value of the partial isomorphism C for a lattice 𝐾. (Contributed by NM, 16-Feb-2014.)
Hypotheses
Ref Expression
dicelval1sta.l = (le‘𝐾)
dicelval1sta.a 𝐴 = (Atoms‘𝐾)
dicelval1sta.h 𝐻 = (LHyp‘𝐾)
dicelval1sta.p 𝑃 = ((oc‘𝐾)‘𝑊)
dicelval1sta.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
dicelval1sta.i 𝐼 = ((DIsoC‘𝐾)‘𝑊)
Assertion
Ref Expression
dicelval1sta (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑌 ∈ (𝐼𝑄)) → (1st𝑌) = ((2nd𝑌)‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
Distinct variable groups:   𝑔,𝐾   𝑄,𝑔   𝑇,𝑔   𝑔,𝑊
Allowed substitution hints:   𝐴(𝑔)   𝑃(𝑔)   𝐻(𝑔)   𝐼(𝑔)   (𝑔)   𝑉(𝑔)   𝑌(𝑔)

Proof of Theorem dicelval1sta
Dummy variables 𝑓 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dicelval1sta.l . . . . . 6 = (le‘𝐾)
2 dicelval1sta.a . . . . . 6 𝐴 = (Atoms‘𝐾)
3 dicelval1sta.h . . . . . 6 𝐻 = (LHyp‘𝐾)
4 dicelval1sta.p . . . . . 6 𝑃 = ((oc‘𝐾)‘𝑊)
5 dicelval1sta.t . . . . . 6 𝑇 = ((LTrn‘𝐾)‘𝑊)
6 eqid 2622 . . . . . 6 ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
7 dicelval1sta.i . . . . . 6 𝐼 = ((DIsoC‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7dicval 36465 . . . . 5 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
98eleq2d 2687 . . . 4 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝑌 ∈ (𝐼𝑄) ↔ 𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}))
109biimp3a 1432 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑌 ∈ (𝐼𝑄)) → 𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
11 eqeq1 2626 . . . . 5 (𝑓 = (1st𝑌) → (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ↔ (1st𝑌) = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄))))
1211anbi1d 741 . . . 4 (𝑓 = (1st𝑌) → ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊)) ↔ ((1st𝑌) = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))))
13 fveq1 6190 . . . . . 6 (𝑠 = (2nd𝑌) → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) = ((2nd𝑌)‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
1413eqeq2d 2632 . . . . 5 (𝑠 = (2nd𝑌) → ((1st𝑌) = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ↔ (1st𝑌) = ((2nd𝑌)‘(𝑔𝑇 (𝑔𝑃) = 𝑄))))
15 eleq1 2689 . . . . 5 (𝑠 = (2nd𝑌) → (𝑠 ∈ ((TEndo‘𝐾)‘𝑊) ↔ (2nd𝑌) ∈ ((TEndo‘𝐾)‘𝑊)))
1614, 15anbi12d 747 . . . 4 (𝑠 = (2nd𝑌) → (((1st𝑌) = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊)) ↔ ((1st𝑌) = ((2nd𝑌)‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ (2nd𝑌) ∈ ((TEndo‘𝐾)‘𝑊))))
1712, 16elopabi 7231 . . 3 (𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} → ((1st𝑌) = ((2nd𝑌)‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ (2nd𝑌) ∈ ((TEndo‘𝐾)‘𝑊)))
1810, 17syl 17 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑌 ∈ (𝐼𝑄)) → ((1st𝑌) = ((2nd𝑌)‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ (2nd𝑌) ∈ ((TEndo‘𝐾)‘𝑊)))
1918simpld 475 1 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑌 ∈ (𝐼𝑄)) → (1st𝑌) = ((2nd𝑌)‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  w3a 1037   = wceq 1483  wcel 1990   class class class wbr 4653  {copab 4712  cfv 5888  crio 6610  1st c1st 7166  2nd c2nd 7167  lecple 15948  occoc 15949  Atomscatm 34550  LHypclh 35270  LTrncltrn 35387  TEndoctendo 36040  DIsoCcdic 36461
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-1st 7168  df-2nd 7169  df-dic 36462
This theorem is referenced by:  dicvaddcl  36479  dicvscacl  36480
  Copyright terms: Public domain W3C validator