Theorem trlset 40140

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 40139	. . . 4 ⊢ (𝐾 ∈ 𝐶 → (trL‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))))
9	8	fveq1d 6828	. . 3 ⊢ (𝐾 ∈ 𝐶 → ((trL‘𝐾)‘𝑊) = ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊))
10	1, 9	eqtrid 2776	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝑅 = ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊))
11		fveq2 6826	. . . . 5 ⊢ (𝑤 = 𝑊 → ((LTrn‘𝐾)‘𝑤) = ((LTrn‘𝐾)‘𝑊))
12		breq2 5099	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑝 ≤ 𝑤 ↔ 𝑝 ≤ 𝑊))
13	12	notbid 318	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (¬ 𝑝 ≤ 𝑤 ↔ ¬ 𝑝 ≤ 𝑊))
14		oveq2 7361	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))
15	14	eqeq2d 2740	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) ↔ 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))
16	13, 15	imbi12d 344	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)) ↔ (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
17	16	ralbidv 3152	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)) ↔ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
18	17	riotabidv 7312	. . . . 5 ⊢ (𝑤 = 𝑊 → (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))) = (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
19	11, 18	mpteq12dv 5182	. . . 4 ⊢ (𝑤 = 𝑊 → (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))
20		eqid 2729	. . . 4 ⊢ (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))))) = (𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))
21		fvex 6839	. . . . 5 ⊢ ((LTrn‘𝐾)‘𝑊) ∈ V
22	21	mptex 7163	. . . 4 ⊢ (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))) ∈ V
23	19, 20, 22	fvmpt 6934	. . 3 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))
24		trlset.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
25	24	mpteq1i 5186	. . 3 ⊢ (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑊) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))))
26	23, 25	eqtr4di 2782	. 2 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑤 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤)))))‘𝑊) = (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))
27	10, 26	sylan9eq 2784	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → 𝑅 = (𝑓 ∈ 𝑇 ↦ (℩𝑥 ∈ 𝐵 ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → 𝑥 = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊)))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044   class class class wbr 5095   ↦ cmpt 5176  ‘cfv 6486  ℩crio 7309  (class class class)co 7353  Basecbs 17138  lecple 17186  joincjn 18235  meetcmee 18236  Atomscatm 39241  LHypclh 39963  LTrncltrn 40080  trLctrl 40137

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-trl 40138

This theorem is referenced by:  trlval  40141