Theorem ltrnset 41282

Description: The set of lattice translations for a fiducial co-atom 𝑊. (Contributed by NM, 11-May-2012.)

Hypotheses

Ref	Expression
ltrnset.l	⊢ ≤ = (le‘𝐾)
ltrnset.j	⊢ ∨ = (join‘𝐾)
ltrnset.m	⊢ ∧ = (meet‘𝐾)
ltrnset.a	⊢ 𝐴 = (Atoms‘𝐾)
ltrnset.h	⊢ 𝐻 = (LHyp‘𝐾)
ltrnset.d	⊢ 𝐷 = ((LDil‘𝐾)‘𝑊)
ltrnset.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)

Assertion

Ref	Expression
ltrnset	⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ∈ 𝐻) → 𝑇 = {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))})

Distinct variable groups:   𝑞,𝑝,𝐴   𝐷,𝑓   𝑓,𝑝,𝑞,𝐾   𝑓,𝑊,𝑝,𝑞

Allowed substitution hints:   𝐴(𝑓)   𝐵(𝑓, 𝑞, 𝑝)   𝐷(𝑞, 𝑝)   𝑇(𝑓, 𝑞, 𝑝)   𝐻(𝑓, 𝑞, 𝑝)   ∨ (𝑓, 𝑞, 𝑝)   ≤ (𝑓, 𝑞, 𝑝)   ∧ (𝑓, 𝑞, 𝑝)

Proof of Theorem ltrnset

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltrnset.t	. . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
2		ltrnset.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
3		ltrnset.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
4		ltrnset.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
5		ltrnset.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
6		ltrnset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
7	2, 3, 4, 5, 6	ltrnfset 41281	. . . 4 ⊢ (𝐾 ∈ 𝐵 → (LTrn‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))}))
8	7	fveq1d 6890	. . 3 ⊢ (𝐾 ∈ 𝐵 → ((LTrn‘𝐾)‘𝑊) = ((𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))})‘𝑊))
9	1, 8	eqtrid 2807	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝑇 = ((𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))})‘𝑊))
10		fveq2 6888	. . . . 5 ⊢ (𝑤 = 𝑊 → ((LDil‘𝐾)‘𝑤) = ((LDil‘𝐾)‘𝑊))
11		ltrnset.d	. . . . 5 ⊢ 𝐷 = ((LDil‘𝐾)‘𝑊)
12	10, 11	eqtr4di 2813	. . . 4 ⊢ (𝑤 = 𝑊 → ((LDil‘𝐾)‘𝑤) = 𝐷)
13		breq2 5106	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑝 ≤ 𝑤 ↔ 𝑝 ≤ 𝑊))
14	13	notbid 321	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (¬ 𝑝 ≤ 𝑤 ↔ ¬ 𝑝 ≤ 𝑊))
15		breq2 5106	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑞 ≤ 𝑤 ↔ 𝑞 ≤ 𝑊))
16	15	notbid 321	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (¬ 𝑞 ≤ 𝑤 ↔ ¬ 𝑞 ≤ 𝑊))
17	14, 16	anbi12d 644	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) ↔ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)))
18		oveq2 7430	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊))
19		oveq2 7430	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))
20	18, 19	eqeq12d 2776	. . . . . 6 ⊢ (𝑤 = 𝑊 → (((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤) ↔ ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊)))
21	17, 20	imbi12d 347	. . . . 5 ⊢ (𝑤 = 𝑊 → (((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤)) ↔ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))))
22	21	2ralbidv 3226	. . . 4 ⊢ (𝑤 = 𝑊 → (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤)) ↔ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))))
23	12, 22	rabeqbidv 3429	. . 3 ⊢ (𝑤 = 𝑊 → {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))} = {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))})
24		eqid 2760	. . 3 ⊢ (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))}) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))})
25	11	fvexi 6902	. . . 4 ⊢ 𝐷 ∈ V
26	25	rabex 5299	. . 3 ⊢ {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))} ∈ V
27	23, 24, 26	fvmpt 6996	. 2 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))})‘𝑊) = {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))})
28	9, 27	sylan9eq 2815	1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ∈ 𝐻) → 𝑇 = {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))})

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412   class class class wbr 5102   ↦ cmpt 5185  ‘cfv 6541  (class class class)co 7422  lecple 17442  joincjn 18492  meetcmee 18493  Atomscatm 40427  LHypclh 41148  LDilcldil 41264  LTrncltrn 41265

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-pw 4558  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-ov 7425  df-ltrn 41269

This theorem is used by:  isltrn  41283