![]() |
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 39573 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸)))) |
9 | dicval2.g | . . . . . 6 ⊢ 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄) | |
10 | 9 | fveq2i 6842 | . . . . 5 ⊢ ((2nd ‘𝑌)‘𝐺) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) |
11 | 10 | eqeq2i 2749 | . . . 4 ⊢ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ↔ (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))) |
12 | 11 | anbi1i 624 | . . 3 ⊢ (((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸) ↔ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸)) |
13 | 12 | anbi2i 623 | . 2 ⊢ ((𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸)) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸))) |
14 | 8, 13 | bitr4di 288 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘𝐺) ∧ (2nd ‘𝑌) ∈ 𝐸)))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3443 class class class wbr 5103 × cxp 5629 ‘cfv 6493 ℩crio 7306 1st c1st 7911 2nd c2nd 7912 lecple 17094 occoc 17095 Atomscatm 37657 LHypclh 38379 LTrncltrn 38496 TEndoctendo 39147 DIsoCcdic 39567 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5240 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7664 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-id 5529 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7307 df-1st 7913 df-2nd 7914 df-dic 39568 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |