Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dicelval2N | Structured version Visualization version GIF version |
Description: Membership in value of the partial isomorphism C for a lattice 𝐾. (Contributed by NM, 25-Feb-2014.) (New usage is discouraged.) |
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 | ⊢ 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄) |
Ref | Expression |
---|---|
dicelval2N | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸)))) |
Step | Hyp | Ref | 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 | 1, 2, 3, 4, 5, 6, 7 | dicelvalN 36467 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸)))) |
9 | dicval2.g | . . . . . 6 ⊢ 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄) | |
10 | 9 | fveq2i 6194 | . . . . 5 ⊢ ((2nd ‘𝑌)‘𝐺) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) |
11 | 10 | eqeq2i 2634 | . . . 4 ⊢ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ↔ (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))) |
12 | 11 | anbi1i 731 | . . 3 ⊢ (((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸) ↔ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸)) |
13 | 12 | anbi2i 730 | . 2 ⊢ ((𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸)) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸))) |
14 | 8, 13 | syl6bbr 278 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸)))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 class class class wbr 4653 × cxp 5112 ‘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: (None) |
Copyright terms: Public domain | W3C validator |