Theorem ltrnfset 40074

Description: The set of all lattice translations for a lattice 𝐾. (Contributed by NM, 11-May-2012.)

Hypotheses

Ref	Expression
ltrnset.l	⊢ ≤ = (le‘𝐾)
ltrnset.j	⊢ ∨ = (join‘𝐾)
ltrnset.m	⊢ ∧ = (meet‘𝐾)
ltrnset.a	⊢ 𝐴 = (Atoms‘𝐾)
ltrnset.h	⊢ 𝐻 = (LHyp‘𝐾)

Assertion

Ref	Expression
ltrnfset	⊢ (𝐾 ∈ 𝐶 → (LTrn‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))}))

Distinct variable groups:   𝑞,𝑝,𝐴   𝑤,𝐻   𝑓,𝑝,𝑞,𝑤,𝐾

Allowed substitution hints:   𝐴(𝑤,𝑓)   𝐶(𝑤,𝑓,𝑞,𝑝)   𝐻(𝑓,𝑞,𝑝)   ∨ (𝑤,𝑓,𝑞,𝑝)   ≤ (𝑤,𝑓,𝑞,𝑝)   ∧ (𝑤,𝑓,𝑞,𝑝)

Proof of Theorem ltrnfset

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3509	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ V)
2		fveq2 6920	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		ltrnset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2798	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6920	. . . . . 6 ⊢ (𝑘 = 𝐾 → (LDil‘𝑘) = (LDil‘𝐾))
6	5	fveq1d 6922	. . . . 5 ⊢ (𝑘 = 𝐾 → ((LDil‘𝑘)‘𝑤) = ((LDil‘𝐾)‘𝑤))
7		fveq2 6920	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
8		ltrnset.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
9	7, 8	eqtr4di 2798	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
10		fveq2 6920	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
11		ltrnset.l	. . . . . . . . . . . 12 ⊢ ≤ = (le‘𝐾)
12	10, 11	eqtr4di 2798	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
13	12	breqd 5177	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑝(le‘𝑘)𝑤 ↔ 𝑝 ≤ 𝑤))
14	13	notbid 318	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (¬ 𝑝(le‘𝑘)𝑤 ↔ ¬ 𝑝 ≤ 𝑤))
15	12	breqd 5177	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑞(le‘𝑘)𝑤 ↔ 𝑞 ≤ 𝑤))
16	15	notbid 318	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (¬ 𝑞(le‘𝑘)𝑤 ↔ ¬ 𝑞 ≤ 𝑤))
17	14, 16	anbi12d 631	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) ↔ (¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤)))
18		fveq2 6920	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (meet‘𝑘) = (meet‘𝐾))
19		ltrnset.m	. . . . . . . . . . 11 ⊢ ∧ = (meet‘𝐾)
20	18, 19	eqtr4di 2798	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (meet‘𝑘) = ∧ )
21		fveq2 6920	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
22		ltrnset.j	. . . . . . . . . . . 12 ⊢ ∨ = (join‘𝐾)
23	21, 22	eqtr4di 2798	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = ∨ )
24	23	oveqd 7465	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑝(join‘𝑘)(𝑓‘𝑝)) = (𝑝 ∨ (𝑓‘𝑝)))
25		eqidd 2741	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → 𝑤 = 𝑤)
26	20, 24, 25	oveq123d 7469	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤))
27	23	oveqd 7465	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑞(join‘𝑘)(𝑓‘𝑞)) = (𝑞 ∨ (𝑓‘𝑞)))
28	20, 27, 25	oveq123d 7469	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))
29	26, 28	eqeq12d 2756	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤) ↔ ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤)))
30	17, 29	imbi12d 344	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤)) ↔ ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))))
31	9, 30	raleqbidv 3354	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤)) ↔ ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))))
32	9, 31	raleqbidv 3354	. . . . 5 ⊢ (𝑘 = 𝐾 → (∀𝑝 ∈ (Atoms‘𝑘)∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤)) ↔ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))))
33	6, 32	rabeqbidv 3462	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑓 ∈ ((LDil‘𝑘)‘𝑤) ∣ ∀𝑝 ∈ (Atoms‘𝑘)∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤))} = {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))})
34	4, 33	mpteq12dv 5257	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑓 ∈ ((LDil‘𝑘)‘𝑤) ∣ ∀𝑝 ∈ (Atoms‘𝑘)∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤))}) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))}))
35		df-ltrn 40062	. . 3 ⊢ LTrn = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑓 ∈ ((LDil‘𝑘)‘𝑤) ∣ ∀𝑝 ∈ (Atoms‘𝑘)∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) → ((𝑝(join‘𝑘)(𝑓‘𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓‘𝑞))(meet‘𝑘)𝑤))}))
36	34, 35, 3	mptfvmpt 7265	. 2 ⊢ (𝐾 ∈ V → (LTrn‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))}))
37	1, 36	syl 17	1 ⊢ (𝐾 ∈ 𝐶 → (LTrn‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑤 ∧ ¬ 𝑞 ≤ 𝑤) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑤) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑤))}))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067  {crab 3443  Vcvv 3488   class class class wbr 5166   ↦ cmpt 5249  ‘cfv 6573  (class class class)co 7448  lecple 17318  joincjn 18381  meetcmee 18382  Atomscatm 39219  LHypclh 39941  LDilcldil 40057  LTrncltrn 40058

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-ltrn 40062

This theorem is referenced by:  ltrnset  40075