Theorem dihfval 42104

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 42103	. . . 4 ⊢ (𝐾 ∈ 𝑉 → (DIsoH‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))))))))
9	8	fveq1d 6880	. . 3 ⊢ (𝐾 ∈ 𝑉 → ((DIsoH‘𝐾)‘𝑊) = ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))‘𝑊))
10	1, 9	eqtrid 2807	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐼 = ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))‘𝑊))
11		breq2 5107	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑥 ≤ 𝑤 ↔ 𝑥 ≤ 𝑊))
12		fveq2 6878	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((DIsoB‘𝐾)‘𝑤) = ((DIsoB‘𝐾)‘𝑊))
13		dihval.d	. . . . . . 7 ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊)
14	12, 13	eqtr4di 2813	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((DIsoB‘𝐾)‘𝑤) = 𝐷)
15	14	fveq1d 6880	. . . . 5 ⊢ (𝑤 = 𝑊 → (((DIsoB‘𝐾)‘𝑤)‘𝑥) = (𝐷‘𝑥))
16		fveq2 6878	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((DVecH‘𝐾)‘𝑤) = ((DVecH‘𝐾)‘𝑊))
17		dihval.u	. . . . . . . . 9 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
18	16, 17	eqtr4di 2813	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((DVecH‘𝐾)‘𝑤) = 𝑈)
19	18	fveq2d 6882	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘((DVecH‘𝐾)‘𝑤)) = (LSubSp‘𝑈))
20		dihval.s	. . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑈)
21	19, 20	eqtr4di 2813	. . . . . 6 ⊢ (𝑤 = 𝑊 → (LSubSp‘((DVecH‘𝐾)‘𝑤)) = 𝑆)
22		breq2 5107	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (𝑞 ≤ 𝑤 ↔ 𝑞 ≤ 𝑊))
23	22	notbid 321	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (¬ 𝑞 ≤ 𝑤 ↔ ¬ 𝑞 ≤ 𝑊))
24		oveq2 7421	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (𝑥 ∧ 𝑤) = (𝑥 ∧ 𝑊))
25	24	oveq2d 7429	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (𝑞 ∨ (𝑥 ∧ 𝑤)) = (𝑞 ∨ (𝑥 ∧ 𝑊)))
26	25	eqeq1d 2762	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥 ↔ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥))
27	23, 26	anbi12d 644	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) ↔ (¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥)))
28	18	fveq2d 6882	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (LSSum‘((DVecH‘𝐾)‘𝑤)) = (LSSum‘𝑈))
29		dihval.p	. . . . . . . . . . 11 ⊢ ⊕ = (LSSum‘𝑈)
30	28, 29	eqtr4di 2813	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (LSSum‘((DVecH‘𝐾)‘𝑤)) = ⊕ )
31		fveq2 6878	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → ((DIsoC‘𝐾)‘𝑤) = ((DIsoC‘𝐾)‘𝑊))
32		dihval.c	. . . . . . . . . . . 12 ⊢ 𝐶 = ((DIsoC‘𝐾)‘𝑊)
33	31, 32	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → ((DIsoC‘𝐾)‘𝑤) = 𝐶)
34	33	fveq1d 6880	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (((DIsoC‘𝐾)‘𝑤)‘𝑞) = (𝐶‘𝑞))
35	14, 24	fveq12d 6885	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)) = (𝐷‘(𝑥 ∧ 𝑊)))
36	30, 34, 35	oveq123d 7434	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))) = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))
37	36	eqeq2d 2771	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))) ↔ 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊)))))
38	27, 37	imbi12d 347	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))) ↔ ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))
39	38	ralbidv 3185	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))) ↔ ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))
40	21, 39	riotaeqbidv 7373	. . . . 5 ⊢ (𝑤 = 𝑊 → (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))
41	11, 15, 40	ifbieq12d 4511	. . . 4 ⊢ (𝑤 = 𝑊 → if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))))) = if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊)))))))
42	41	mpteq2dv 5199	. . 3 ⊢ (𝑤 = 𝑊 → (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))) = (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))))
43		eqid 2760	. . 3 ⊢ (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤)))))))) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))
44	42, 43, 2	mptfvmpt 7227	. 2 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑤, (((DIsoB‘𝐾)‘𝑤)‘𝑥), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑤))∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑤 ∧ (𝑞 ∨ (𝑥 ∧ 𝑤)) = 𝑥) → 𝑢 = ((((DIsoC‘𝐾)‘𝑤)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑤))(((DIsoB‘𝐾)‘𝑤)‘(𝑥 ∧ 𝑤))))))))‘𝑊) = (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))))
45	10, 44	sylan9eq 2815	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑥 ∈ 𝐵 ↦ if(𝑥 ≤ 𝑊, (𝐷‘𝑥), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑥 ∧ 𝑊))))))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ifcif 4482   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6533  ℩crio 7369  (class class class)co 7413  Basecbs 17301  lecple 17349  joincjn 18399  meetcmee 18400  LSSumclsm 19761  LSubSpclss 21115  Atomscatm 40136  LHypclh 40857  DVecHcdvh 41951  DIsoBcdib 42011  DIsoCcdic 42045  DIsoHcdih 42101

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-dih 42102

This theorem is used by:  dihval  42105  dihf11lem  42139