dicelvalN - Mathbox for Norm Megill

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

Theorem dicelvalN 41635

Description: Membership in value of the partial isomorphism C for a lattice 𝐾. (Contributed by NM, 25-Feb-2014.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
dicval.l	⊢ ≤ = (le‘𝐾)
dicval.a	⊢ 𝐴 = (Atoms‘𝐾)
dicval.h	⊢ 𝐻 = (LHyp‘𝐾)
dicval.p	⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
dicval.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
dicval.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
dicval.i	⊢ 𝐼 = ((DIsoC‘𝐾)‘𝑊)

**Assertion**
Ref	Expression
dicelvalN	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1^st ‘𝑌) = ((2^nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2^nd ‘𝑌) ∈ 𝐸))))

Distinct variable groups: 𝑔,𝐾 𝑇,𝑔 𝑔,𝑊 𝑄,𝑔 Allowed substitution hints: 𝐴(𝑔) 𝑃(𝑔) 𝐸(𝑔) 𝐻(𝑔) 𝐼(𝑔) ≤ (𝑔) 𝑉(𝑔) 𝑌(𝑔)

Proof of Theorem dicelvalN Dummy variables 𝑓 𝑠 are mutually distinct and distinct from all other variables.

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	1, 2, 3, 4, 5, 6, 7	dicval 41633	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
9	8	eleq2d 2823	. 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ 𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)}))
10		vex 3434	. . . . . 6 ⊢ 𝑓 ∈ V
11		vex 3434	. . . . . 6 ⊢ 𝑠 ∈ V
12	10, 11	op1std 7943	. . . . 5 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → (1^st ‘𝑌) = 𝑓)
13	10, 11	op2ndd 7944	. . . . . 6 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → (2^nd ‘𝑌) = 𝑠)
14	13	fveq1d 6834	. . . . 5 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → ((2^nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
15	12, 14	eqeq12d 2753	. . . 4 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → ((1^st ‘𝑌) = ((2^nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ 𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
16	13	eleq1d 2822	. . . 4 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → ((2^nd ‘𝑌) ∈ 𝐸 ↔ 𝑠 ∈ 𝐸))
17	15, 16	anbi12d 633	. . 3 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → (((1^st ‘𝑌) = ((2^nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2^nd ‘𝑌) ∈ 𝐸) ↔ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)))
18	17	elopaba 5755	. 2 ⊢ (𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ↔ (𝑌 ∈ (V × V) ∧ ((1^st ‘𝑌) = ((2^nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2^nd ‘𝑌) ∈ 𝐸)))
19	9, 18	bitrdi 287	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1^st ‘𝑌) = ((2^nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2^nd ‘𝑌) ∈ 𝐸))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ⟨cop 4574 class class class wbr 5086 {copab 5148 × cxp 5620 ‘cfv 6490 ℩crio 7314 1^st c1st 7931 2^nd c2nd 7932 lecple 17216 occoc 17217 Atomscatm 39720 LHypclh 40441 LTrncltrn 40558 TEndoctendo 41209 DIsoCcdic 41629

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-1st 7933 df-2nd 7934 df-dic 41630

This theorem is referenced by: dicelval2N 41639

W3C validator