Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dicelval3 | Structured version Visualization version GIF version |
Description: Member of the partial isomorphism C. (Contributed by NM, 26-Feb-2014.) |
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 |
---|---|
dicelval3 | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ ∃𝑠 ∈ 𝐸 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dicval.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
2 | dicval.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
3 | dicval.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
4 | dicval.p | . . . 4 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊) | |
5 | dicval.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
6 | dicval.e | . . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) | |
7 | dicval.i | . . . 4 ⊢ 𝐼 = ((DIsoC‘𝐾)‘𝑊) | |
8 | dicval2.g | . . . 4 ⊢ 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | dicval2 39120 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)}) |
10 | 9 | eleq2d 2824 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ 𝑌 ∈ {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)})) |
11 | excom 2164 | . . . 4 ⊢ (∃𝑓∃𝑠(𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑠∃𝑓(𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸))) | |
12 | an12 641 | . . . . . . 7 ⊢ ((𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ (𝑓 = (𝑠‘𝐺) ∧ (𝑌 = 〈𝑓, 𝑠〉 ∧ 𝑠 ∈ 𝐸))) | |
13 | 12 | exbii 1851 | . . . . . 6 ⊢ (∃𝑓(𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑓(𝑓 = (𝑠‘𝐺) ∧ (𝑌 = 〈𝑓, 𝑠〉 ∧ 𝑠 ∈ 𝐸))) |
14 | fvex 6769 | . . . . . . 7 ⊢ (𝑠‘𝐺) ∈ V | |
15 | opeq1 4801 | . . . . . . . . 9 ⊢ (𝑓 = (𝑠‘𝐺) → 〈𝑓, 𝑠〉 = 〈(𝑠‘𝐺), 𝑠〉) | |
16 | 15 | eqeq2d 2749 | . . . . . . . 8 ⊢ (𝑓 = (𝑠‘𝐺) → (𝑌 = 〈𝑓, 𝑠〉 ↔ 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) |
17 | 16 | anbi1d 629 | . . . . . . 7 ⊢ (𝑓 = (𝑠‘𝐺) → ((𝑌 = 〈𝑓, 𝑠〉 ∧ 𝑠 ∈ 𝐸) ↔ (𝑌 = 〈(𝑠‘𝐺), 𝑠〉 ∧ 𝑠 ∈ 𝐸))) |
18 | 14, 17 | ceqsexv 3469 | . . . . . 6 ⊢ (∃𝑓(𝑓 = (𝑠‘𝐺) ∧ (𝑌 = 〈𝑓, 𝑠〉 ∧ 𝑠 ∈ 𝐸)) ↔ (𝑌 = 〈(𝑠‘𝐺), 𝑠〉 ∧ 𝑠 ∈ 𝐸)) |
19 | ancom 460 | . . . . . 6 ⊢ ((𝑌 = 〈(𝑠‘𝐺), 𝑠〉 ∧ 𝑠 ∈ 𝐸) ↔ (𝑠 ∈ 𝐸 ∧ 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) | |
20 | 13, 18, 19 | 3bitri 296 | . . . . 5 ⊢ (∃𝑓(𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ (𝑠 ∈ 𝐸 ∧ 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) |
21 | 20 | exbii 1851 | . . . 4 ⊢ (∃𝑠∃𝑓(𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑠(𝑠 ∈ 𝐸 ∧ 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) |
22 | 11, 21 | bitri 274 | . . 3 ⊢ (∃𝑓∃𝑠(𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑠(𝑠 ∈ 𝐸 ∧ 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) |
23 | elopab 5433 | . . 3 ⊢ (𝑌 ∈ {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)} ↔ ∃𝑓∃𝑠(𝑌 = 〈𝑓, 𝑠〉 ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸))) | |
24 | df-rex 3069 | . . 3 ⊢ (∃𝑠 ∈ 𝐸 𝑌 = 〈(𝑠‘𝐺), 𝑠〉 ↔ ∃𝑠(𝑠 ∈ 𝐸 ∧ 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) | |
25 | 22, 23, 24 | 3bitr4i 302 | . 2 ⊢ (𝑌 ∈ {〈𝑓, 𝑠〉 ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)} ↔ ∃𝑠 ∈ 𝐸 𝑌 = 〈(𝑠‘𝐺), 𝑠〉) |
26 | 10, 25 | bitrdi 286 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ ∃𝑠 ∈ 𝐸 𝑌 = 〈(𝑠‘𝐺), 𝑠〉)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 ∃wrex 3064 〈cop 4564 class class class wbr 5070 {copab 5132 ‘cfv 6418 ℩crio 7211 lecple 16895 occoc 16896 Atomscatm 37204 LHypclh 37925 LTrncltrn 38042 TEndoctendo 38693 DIsoCcdic 39113 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-dic 39114 |
This theorem is referenced by: cdlemn11pre 39151 dihord2pre 39166 |
Copyright terms: Public domain | W3C validator |