| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dicelval1sta | Structured version Visualization version GIF version | ||
| Description: Membership in value of the partial isomorphism C for a lattice 𝐾. (Contributed by NM, 16-Feb-2014.) |
| Ref | Expression |
|---|---|
| dicelval1sta.l | ⊢ ≤ = (le‘𝐾) |
| dicelval1sta.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dicelval1sta.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dicelval1sta.p | ⊢ 𝑃 = ((oc‘𝐾)‘𝑊) |
| dicelval1sta.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| dicelval1sta.i | ⊢ 𝐼 = ((DIsoC‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| dicelval1sta | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))) |
| Step | Hyp | Ref | 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 2763 | . . . . . 6 ⊢ ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊) | |
| 7 | dicelval1sta.i | . . . . . 6 ⊢ 𝐼 = ((DIsoC‘𝐾)‘𝑊) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | dicval 41950 | . . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) |
| 9 | 8 | eleq2d 2849 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ 𝑌 ∈ {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})) |
| 10 | 9 | biimp3a 1498 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → 𝑌 ∈ {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}) |
| 11 | eqeq1 2767 | . . . . 5 ⊢ (𝑓 = (1st ‘𝑌) → (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ (1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))) | |
| 12 | 11 | anbi1d 642 | . . . 4 ⊢ (𝑓 = (1st ‘𝑌) → ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊)) ↔ ((1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊)))) |
| 13 | fveq1 6880 | . . . . . 6 ⊢ (𝑠 = (2nd ‘𝑌) → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))) | |
| 14 | 13 | eqeq2d 2774 | . . . . 5 ⊢ (𝑠 = (2nd ‘𝑌) → ((1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))) |
| 15 | eleq1 2851 | . . . . 5 ⊢ (𝑠 = (2nd ‘𝑌) → (𝑠 ∈ ((TEndo‘𝐾)‘𝑊) ↔ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊))) | |
| 16 | 14, 15 | anbi12d 643 | . . . 4 ⊢ (𝑠 = (2nd ‘𝑌) → (((1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊)) ↔ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊)))) |
| 17 | 12, 16 | elopabi 8055 | . . 3 ⊢ (𝑌 ∈ {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} → ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊))) |
| 18 | 10, 17 | syl 18 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊))) |
| 19 | 18 | simpld 499 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 class class class wbr 5109 {copab 5173 ‘cfv 6536 ℩crio 7366 1st c1st 7980 2nd c2nd 7981 lecple 17312 occoc 17313 Atomscatm 40037 LHypclh 40758 LTrncltrn 40875 TEndoctendo 41526 DIsoCcdic 41946 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 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 7367 df-1st 7982 df-2nd 7983 df-dic 41947 |
| This theorem is referenced by: dicvaddcl 41964 dicvscacl 41965 |
| Copyright terms: Public domain | W3C validator |