Theorem trlfset 41324

Description: The set of all traces of lattice translations for a lattice 𝐾. (Contributed by NM, 20-May-2012.)

Hypotheses

Ref	Expression
trlset.b	⊢ 𝐵 = (Base‘𝐾)
trlset.l	⊢ ≤ = (le‘𝐾)
trlset.j	⊢ ∨ = (join‘𝐾)
trlset.m	⊢ ∧ = (meet‘𝐾)
trlset.a	⊢ 𝐴 = (Atoms‘𝐾)
trlset.h	⊢ 𝐻 = (LHyp‘𝐾)

Assertion

Ref	Expression
trlfset	⊢ (𝐾 ∈ 𝐶 → (trL‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))

Distinct variable groups:   𝐴,𝑝   𝑥,𝐵   𝑤,𝐻   𝑓,𝑝,𝑤,𝑥,𝐾

Allowed substitution hints:   𝐴(𝑥, 𝑤, 𝑓)   𝐵(𝑤, 𝑓, 𝑝)   𝐶(𝑥, 𝑤, 𝑓, 𝑝)   𝐻(𝑥, 𝑓, 𝑝)   ∨ (𝑥, 𝑤, 𝑓, 𝑝)   ≤ (𝑥, 𝑤, 𝑓, 𝑝)   ∧ (𝑥, 𝑤, 𝑓, 𝑝)

Proof of Theorem trlfset

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3471	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ V)
2		fveq2 6888	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		trlset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2813	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6888	. . . . . 6 ⊢ (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
6	5	fveq1d 6890	. . . . 5 ⊢ (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
7		fveq2 6888	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
8		trlset.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
9	7, 8	eqtr4di 2813	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
10		fveq2 6888	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
11		trlset.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
12	10, 11	eqtr4di 2813	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
13		fveq2 6888	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
14		trlset.l	. . . . . . . . . . 11 ⊢ ≤ = (le‘𝐾)
15	13, 14	eqtr4di 2813	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
16	15	breqd 5113	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (𝑝(le‘𝑘)𝑤 ↔ 𝑝 ≤ 𝑤))
17	16	notbid 321	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (¬ 𝑝(le‘𝑘)𝑤 ↔ ¬ 𝑝 ≤ 𝑤))
18		fveq2 6888	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (meet‘𝑘) = (meet‘𝐾))
19		trlset.m	. . . . . . . . . . 11 ⊢ ∧ = (meet‘𝐾)
20	18, 19	eqtr4di 2813	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (meet‘𝑘) = ∧ )
21		fveq2 6888	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
22		trlset.j	. . . . . . . . . . . 12 ⊢ ∨ = (join‘𝐾)
23	21, 22	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = ∨ )
24	23	oveqd 7439	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑝(join‘𝑘)(𝑓‘𝑝)) = (𝑝 ∨ (𝑓‘𝑝)))
25		eqidd 2761	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → 𝑤 = 𝑤)
26	20, 24, 25	oveq123d 7443	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))
27	26	eqeq2d 2771	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) ↔ 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))
28	17, 27	imbi12d 347	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤)) ↔ (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))
29	12, 28	raleqbidv 3334	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤)) ↔ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))
30	9, 29	riotaeqbidv 7382	. . . . 5 ⊢ (𝑘 = 𝐾 → (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤))) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))
31	6, 30	mpteq12dv 5191	. . . 4 ⊢ (𝑘 = 𝐾 → (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤)))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))
32	4, 31	mpteq12dv 5191	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤))))) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))
33		df-trl 41323	. . 3 ⊢ trL = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤))))))
34	32, 33, 3	mptfvmpt 7236	. 2 ⊢ (𝐾 ∈ V → (trL‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))
35	1, 34	syl 18	1 ⊢ (𝐾 ∈ 𝐶 → (trL‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   class class class wbr 5102   ↦ cmpt 5185  ‘cfv 6541  ℩crio 7378  (class class class)co 7422  Basecbs 17394  lecple 17442  joincjn 18492  meetcmee 18493  Atomscatm 40427  LHypclh 41148  LTrncltrn 41265  trLctrl 41322

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7379  df-ov 7425  df-trl 41323

This theorem is used by:  trlset  41325