Theorem trlval 40661

Description: The value of the trace of a lattice translation. (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‘𝐾)
trlset.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
trlset.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

Assertion

Ref	Expression
trlval	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘𝐹) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))))

Distinct variable groups:   𝐴,𝑝   𝑥,𝐵   𝑥,𝑝,𝐾   𝑊,𝑝,𝑥   𝐹,𝑝,𝑥

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑝)   𝑅(𝑥,𝑝)   𝑇(𝑥,𝑝)   𝐻(𝑥,𝑝)   ∨ (𝑥,𝑝)   ≤ (𝑥,𝑝)   ∧ (𝑥,𝑝)   𝑉(𝑥,𝑝)

Proof of Theorem trlval

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		trlset.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		trlset.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		trlset.j	. . . 4 ⊢ ∨ = (join‘𝐾)
4		trlset.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
5		trlset.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
6		trlset.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
7		trlset.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8		trlset.r	. . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
9	1, 2, 3, 4, 5, 6, 7, 8	trlset 40660	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝑅 = (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))
10	9	fveq1d 6836	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑅‘𝐹) = ((𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))‘𝐹))
11		fveq1 6833	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑝) = (𝐹‘𝑝))
12	11	oveq2d 7379	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑝 ∨ (𝑓‘𝑝)) = (𝑝 ∨ (𝐹‘𝑝)))
13	12	oveq1d 7378	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))
14	13	eqeq2d 2751	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) ↔ 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊)))
15	14	imbi2d 341	. . . . 5 ⊢ (𝑓 = 𝐹 → ((¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)) ↔ (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))))
16	15	ralbidv 3163	. . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)) ↔ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))))
17	16	riotabidv 7322	. . 3 ⊢ (𝑓 = 𝐹 → (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))))
18		eqid 2740	. . 3 ⊢ (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))) = (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
19		riotaex 7324	. . 3 ⊢ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))) ∈ V
20	17, 18, 19	fvmpt 6942	. 2 ⊢ (𝐹 ∈ 𝑇 → ((𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))‘𝐹) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))))
21	10, 20	sylan9eq 2795	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘𝐹) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  ∀wral 3054   class class class wbr 5079   ↦ cmpt 5160  ‘cfv 6492  ℩crio 7319  (class class class)co 7363  Basecbs 17177  lecple 17225  joincjn 18275  meetcmee 18276  Atomscatm 39762  LHypclh 40483  LTrncltrn 40600  trLctrl 40657

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-trl 40658

This theorem is referenced by:  trlval2  40662