Theorem trlfset 40975

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 3479	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ V)
2		fveq2 6888	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		trlset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2819	. . . 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 2819	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
10		fveq2 6888	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
11		trlset.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
12	10, 11	eqtr4di 2819	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
13		fveq2 6888	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
14		trlset.l	. . . . . . . . . . 11 ⊢ ≤ = (le‘𝐾)
15	13, 14	eqtr4di 2819	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
16	15	breqd 5125	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (𝑝(le‘𝑘)𝑤 ↔ 𝑝 ≤ 𝑤))
17	16	notbid 321	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (¬ 𝑝(le‘𝑘)𝑤 ↔ ¬ 𝑝 ≤ 𝑤))
18		fveq2 6888	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (meet‘𝑘) = (meet‘𝐾))
19		trlset.m	. . . . . . . . . . 11 ⊢ ∧ = (meet‘𝐾)
20	18, 19	eqtr4di 2819	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (meet‘𝑘) = ∧ )
21		fveq2 6888	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
22		trlset.j	. . . . . . . . . . . 12 ⊢ ∨ = (join‘𝐾)
23	21, 22	eqtr4di 2819	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = ∨ )
24	23	oveqd 7440	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑝(join‘𝑘)(𝑓‘𝑝)) = (𝑝 ∨ (𝑓‘𝑝)))
25		eqidd 2767	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → 𝑤 = 𝑤)
26	20, 24, 25	oveq123d 7444	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))
27	26	eqeq2d 2777	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) ↔ 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))
28	17, 27	imbi12d 347	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤)) ↔ (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))
29	12, 28	raleqbidv 3341	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤)) ↔ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))
30	9, 29	riotaeqbidv 7383	. . . . 5 ⊢ (𝑘 = 𝐾 → (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤))) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))
31	6, 30	mpteq12dv 5203	. . . 4 ⊢ (𝑘 = 𝐾 → (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤)))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))
32	4, 31	mpteq12dv 5203	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤))))) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))
33		df-trl 40974	. . 3 ⊢ trL = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (℩𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤 → 𝑥 = ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤))))))
34	32, 33, 3	mptfvmpt 7233	. 2 ⊢ (𝐾 ∈ V → (trL‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))
35	1, 34	syl 18	1 ⊢ (𝐾 ∈ 𝐶 → (trL‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2146  ∀wral 3082  Vcvv 3458   class class class wbr 5114   ↦ cmpt 5197  ‘cfv 6543  ℩crio 7379  (class class class)co 7423  Basecbs 17294  lecple 17342  joincjn 18392  meetcmee 18393  Atomscatm 40078  LHypclh 40799  LTrncltrn 40916  trLctrl 40973

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-trl 40974

This theorem is used by:  trlset  40976