Theorem trlset 39666

Description: The set of traces of lattice translations for a fiducial co-atom 𝑊. (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
trlset	⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → 𝑅 = (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))

Distinct variable groups:   𝐴,𝑝   𝑥,𝐵   𝑓,𝑝,𝑥,𝐾   𝑇,𝑓   𝑓,𝑊,𝑝,𝑥

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

Proof of Theorem trlset

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		trlset.r	. . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
2		trlset.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
3		trlset.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
4		trlset.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
5		trlset.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
6		trlset.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
7		trlset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
8	2, 3, 4, 5, 6, 7	trlfset 39665	. . . 4 ⊢ (𝐾 ∈ 𝐶 → (trL‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))
9	8	fveq1d 6904	. . 3 ⊢ (𝐾 ∈ 𝐶 → ((trL‘𝐾)‘𝑊) = ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊))
10	1, 9	eqtrid 2780	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝑅 = ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊))
11		fveq2 6902	. . . . 5 ⊢ (𝑤 = 𝑊 → ((LTrn‘𝐾)‘𝑤) = ((LTrn‘𝐾)‘𝑊))
12		breq2 5156	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑝 ≤ 𝑤 ↔ 𝑝 ≤ 𝑊))
13	12	notbid 317	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (¬ 𝑝 ≤ 𝑤 ↔ ¬ 𝑝 ≤ 𝑊))
14		oveq2 7434	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))
15	14	eqeq2d 2739	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) ↔ 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))
16	13, 15	imbi12d 343	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)) ↔ (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
17	16	ralbidv 3175	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)) ↔ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
18	17	riotabidv 7384	. . . . 5 ⊢ (𝑤 = 𝑊 → (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
19	11, 18	mpteq12dv 5243	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))
20		eqid 2728	. . . 4 ⊢ (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))
21		fvex 6915	. . . . 5 ⊢ ((LTrn‘𝐾)‘𝑊) ∈ V
22	21	mptex 7241	. . . 4 ⊢ (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))) ∈ V
23	19, 20, 22	fvmpt 7010	. . 3 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))
24		trlset.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
25	24	mpteq1i 5248	. . 3 ⊢ (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
26	23, 25	eqtr4di 2786	. 2 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊) = (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))
27	10, 26	sylan9eq 2788	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → 𝑅 = (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 394   = wceq 1533   ∈ wcel 2098  ∀wral 3058   class class class wbr 5152   ↦ cmpt 5235  ‘cfv 6553  ℩crio 7381  (class class class)co 7426  Basecbs 17187  lecple 17247  joincjn 18310  meetcmee 18311  Atomscatm 38767  LHypclh 39489  LTrncltrn 39606  trLctrl 39663

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-rep 5289  ax-sep 5303  ax-nul 5310  ax-pr 5433

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-reu 3375  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-iun 5002  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-fv 6561  df-riota 7382  df-ov 7429  df-trl 39664

This theorem is referenced by:  trlval  39667