Theorem isltrn 38133

Description: The predicate "is a lattice translation". Similar to definition of translation in [Crawley] p. 111. (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
isltrn	⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ (𝐹 ∈ 𝐷 ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝐹‘𝑞)) ∧ 𝑊)))))

Distinct variable groups:   𝑞,𝑝,𝐴   𝐾,𝑝,𝑞   𝑊,𝑝,𝑞   𝐹,𝑝,𝑞

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

Proof of Theorem isltrn

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltrnset.l	. . . 4 ⊢ ≤ = (le‘𝐾)
2		ltrnset.j	. . . 4 ⊢ ∨ = (join‘𝐾)
3		ltrnset.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
4		ltrnset.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
5		ltrnset.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
6		ltrnset.d	. . . 4 ⊢ 𝐷 = ((LDil‘𝐾)‘𝑊)
7		ltrnset.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8	1, 2, 3, 4, 5, 6, 7	ltrnset 38132	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ∈ 𝐻) → 𝑇 = {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))})
9	8	eleq2d 2824	. 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ 𝐹 ∈ {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))}))
10		fveq1 6773	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑝) = (𝐹‘𝑝))
11	10	oveq2d 7291	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑝 ∨ (𝑓‘𝑝)) = (𝑝 ∨ (𝐹‘𝑝)))
12	11	oveq1d 7290	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊))
13		fveq1 6773	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑞) = (𝐹‘𝑞))
14	13	oveq2d 7291	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑞 ∨ (𝑓‘𝑞)) = (𝑞 ∨ (𝐹‘𝑞)))
15	14	oveq1d 7290	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊) = ((𝑞 ∨ (𝐹‘𝑞)) ∧ 𝑊))
16	12, 15	eqeq12d 2754	. . . . 5 ⊢ (𝑓 = 𝐹 → (((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊) ↔ ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝐹‘𝑞)) ∧ 𝑊)))
17	16	imbi2d 341	. . . 4 ⊢ (𝑓 = 𝐹 → (((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊)) ↔ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝐹‘𝑞)) ∧ 𝑊))))
18	17	2ralbidv 3129	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊)) ↔ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝐹‘𝑞)) ∧ 𝑊))))
19	18	elrab 3624	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ 𝐷 ∣ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝑓‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝑓‘𝑞)) ∧ 𝑊))} ↔ (𝐹 ∈ 𝐷 ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝐹‘𝑞)) ∧ 𝑊))))
20	9, 19	bitrdi 287	1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ (𝐹 ∈ 𝐷 ∧ ∀𝑝 ∈ 𝐴 ∀𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) → ((𝑝 ∨ (𝐹‘𝑝)) ∧ 𝑊) = ((𝑞 ∨ (𝐹‘𝑞)) ∧ 𝑊)))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064  {crab 3068   class class class wbr 5074  ‘cfv 6433  (class class class)co 7275  lecple 16969  joincjn 18029  meetcmee 18030  Atomscatm 37277  LHypclh 37998  LDilcldil 38114  LTrncltrn 38115

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-ltrn 38119

This theorem is referenced by:  isltrn2N  38134  ltrnu  38135  ltrnldil  38136  ltrncnv  38160  idltrn  38164  cdleme50ltrn  38571  ltrnco  38733