Theorem dihfval 41214

Description: Isomorphism H for a lattice 𝐾. Definition of isomorphism map in [Crawley] p. 122 line 3. (Contributed by NM, 28-Jan-2014.)

Hypotheses

Ref	Expression
dihval.b	⊢ 𝐵 = (Base‘𝐾)
dihval.l	⊢ ≤ = (le‘𝐾)
dihval.j	⊢ ∨ = (join‘𝐾)
dihval.m	⊢ ∧ = (meet‘𝐾)
dihval.a	⊢ 𝐴 = (Atoms‘𝐾)
dihval.h	⊢ 𝐻 = (LHyp‘𝐾)
dihval.i	⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊)
dihval.d	⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊)
dihval.c	⊢ 𝐶 = ((DIsoC‘𝐾)‘𝑊)
dihval.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
dihval.s	⊢ 𝑆 = (LSubSp‘𝑈)
dihval.p	⊢ ⊕ = (LSSum‘𝑈)

Assertion

Ref	Expression
dihfval	⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))))

Distinct variable groups:   𝐴,𝑞   𝑢,𝑞,𝑥,𝐾   𝑥,𝐵   𝑢,𝑆   𝑊,𝑞,𝑢,𝑥

Allowed substitution hints:   𝐴(𝑥,𝑢)   𝐵(𝑢,𝑞)   𝐶(𝑥,𝑢,𝑞)   𝐷(𝑥,𝑢,𝑞)   ⊕ (𝑥,𝑢,𝑞)   𝑆(𝑥,𝑞)   𝑈(𝑥,𝑢,𝑞)   𝐻(𝑥,𝑢,𝑞)   𝐼(𝑥,𝑢,𝑞)   ∨ (𝑥,𝑢,𝑞)   ≤ (𝑥,𝑢,𝑞)   ∧ (𝑥,𝑢,𝑞)   𝑉(𝑥,𝑢,𝑞)

Proof of Theorem dihfval

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dihval.i	. . 3 ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊)
2		dihval.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
3		dihval.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
4		dihval.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
5		dihval.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
6		dihval.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
7		dihval.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
8	2, 3, 4, 5, 6, 7	dihffval 41213	. . . 4 ⊢ (𝐾 ∈ 𝑉 → (DIsoH‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))))))))
9	8	fveq1d 6909	. . 3 ⊢ (𝐾 ∈ 𝑉 → ((DIsoH‘𝐾)‘𝑊) = ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))‘𝑊))
10	1, 9	eqtrid 2787	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐼 = ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))‘𝑊))
11		breq2 5152	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑥 ≤ 𝑤 ↔ 𝑥 ≤ 𝑊))
12		fveq2 6907	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((DIsoB‘𝐾)‘𝑤) = ((DIsoB‘𝐾)‘𝑊))
13		dihval.d	. . . . . . 7 ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊)
14	12, 13	eqtr4di 2793	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((DIsoB‘𝐾)‘𝑤) = 𝐷)
15	14	fveq1d 6909	. . . . 5 ⊢ (𝑤 = 𝑊 → (((DIsoB‘𝐾)‘𝑤)‘𝑥) = (𝐷‘𝑥))
16		fveq2 6907	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((DVecH‘𝐾)‘𝑤) = ((DVecH‘𝐾)‘𝑊))
17		dihval.u	. . . . . . . . 9 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
18	16, 17	eqtr4di 2793	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((DVecH‘𝐾)‘𝑤) = 𝑈)
19	18	fveq2d 6911	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘((DVecH‘𝐾)‘𝑤)) = (LSubSp‘𝑈))
20		dihval.s	. . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑈)
21	19, 20	eqtr4di 2793	. . . . . 6 ⊢ (𝑤 = 𝑊 → (LSubSp‘((DVecH‘𝐾)‘𝑤)) = 𝑆)
22		breq2 5152	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (𝑞 ≤ 𝑤 ↔ 𝑞 ≤ 𝑊))
23	22	notbid 318	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (¬ 𝑞 ≤ 𝑤 ↔ ¬ 𝑞 ≤ 𝑊))
24		oveq2 7439	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (𝑥 ∧ 𝑤) = (𝑥 ∧ 𝑊))
25	24	oveq2d 7447	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (𝑞 ∨ (𝑥 ∧ 𝑤)) = (𝑞 ∨ (𝑥 ∧ 𝑊)))
26	25	eqeq1d 2737	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥 ↔ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥))
27	23, 26	anbi12d 632	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) ↔ (¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥)))
28	18	fveq2d 6911	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (LSSum‘((DVecH‘𝐾)‘𝑤)) = (LSSum‘𝑈))
29		dihval.p	. . . . . . . . . . 11 ⊢ ⊕ = (LSSum‘𝑈)
30	28, 29	eqtr4di 2793	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (LSSum‘((DVecH‘𝐾)‘𝑤)) = ⊕ )
31		fveq2 6907	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → ((DIsoC‘𝐾)‘𝑤) = ((DIsoC‘𝐾)‘𝑊))
32		dihval.c	. . . . . . . . . . . 12 ⊢ 𝐶 = ((DIsoC‘𝐾)‘𝑊)
33	31, 32	eqtr4di 2793	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → ((DIsoC‘𝐾)‘𝑤) = 𝐶)
34	33	fveq1d 6909	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (((DIsoC‘𝐾)‘𝑤)‘𝑞) = (𝐶‘𝑞))
35	14, 24	fveq12d 6914	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)) = (𝐷‘(𝑥 ∧ 𝑊)))
36	30, 34, 35	oveq123d 7452	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))) = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))
37	36	eqeq2d 2746	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))) ↔ 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊)))))
38	27, 37	imbi12d 344	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))) ↔ ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))
39	38	ralbidv 3176	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))) ↔ ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))
40	21, 39	riotaeqbidv 7391	. . . . 5 ⊢ (𝑤 = 𝑊 → (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))
41	11, 15, 40	ifbieq12d 4559	. . . 4 ⊢ (𝑤 = 𝑊 → if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))))) = if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊)))))))
42	41	mpteq2dv 5250	. . 3 ⊢ (𝑤 = 𝑊 → (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))) = (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))))
43		eqid 2735	. . 3 ⊢ (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))))))) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))
44	42, 43, 2	mptfvmpt 7248	. 2 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))‘𝑊) = (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))))
45	10, 44	sylan9eq 2795	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ifcif 4531   class class class wbr 5148   ↦ cmpt 5231  ‘cfv 6563  ℩crio 7387  (class class class)co 7431  Basecbs 17245  lecple 17305  joincjn 18369  meetcmee 18370  LSSumclsm 19667  LSubSpclss 20947  Atomscatm 39245  LHypclh 39967  DVecHcdvh 41061  DIsoBcdib 41121  DIsoCcdic 41155  DIsoHcdih 41211

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-dih 41212

This theorem is referenced by:  dihval  41215  dihf11lem  41249