Theorem ltrnid 40154

Description: A lattice translation is the identity function iff all atoms not under the fiducial co-atom 𝑊 are equal to their values. (Contributed by NM, 24-May-2012.)

Hypotheses

Ref	Expression
ltrneq.b	⊢ 𝐵 = (Base‘𝐾)
ltrneq.l	⊢ ≤ = (le‘𝐾)
ltrneq.a	⊢ 𝐴 = (Atoms‘𝐾)
ltrneq.h	⊢ 𝐻 = (LHyp‘𝐾)
ltrneq.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)

Assertion

Ref	Expression
ltrnid	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) ↔ 𝐹 = ( I ↾ 𝐵)))

Distinct variable groups:   𝐴,𝑝   𝐵,𝑝   𝐹,𝑝   𝐻,𝑝   𝐾,𝑝   𝑇,𝑝   𝑊,𝑝

Allowed substitution hint:   ≤ (𝑝)

Proof of Theorem ltrnid

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp-4l 782	. . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) ∧ 𝑥 ∈ 𝐵) → 𝐾 ∈ HL)
2		ltrneq.h	. . . . . . . . 9 ⊢ 𝐻 = (LHyp‘𝐾)
3		eqid 2735	. . . . . . . . 9 ⊢ (LAut‘𝐾) = (LAut‘𝐾)
4		ltrneq.t	. . . . . . . . 9 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
5	2, 3, 4	ltrnlaut 40142	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹 ∈ (LAut‘𝐾))
6	5	ad2antrr 726	. . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) ∧ 𝑥 ∈ 𝐵) → 𝐹 ∈ (LAut‘𝐾))
7		simpr 484	. . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
8		simplll 774	. . . . . . . . . . . . 13 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ≤ 𝑊) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
9		simpllr 775	. . . . . . . . . . . . 13 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ≤ 𝑊) → 𝐹 ∈ 𝑇)
10		ltrneq.b	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = (Base‘𝐾)
11		ltrneq.a	. . . . . . . . . . . . . . 15 ⊢ 𝐴 = (Atoms‘𝐾)
12	10, 11	atbase 39307	. . . . . . . . . . . . . 14 ⊢ (𝑝 ∈ 𝐴 → 𝑝 ∈ 𝐵)
13	12	ad2antlr 727	. . . . . . . . . . . . 13 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ≤ 𝑊) → 𝑝 ∈ 𝐵)
14		simpr 484	. . . . . . . . . . . . 13 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ≤ 𝑊) → 𝑝 ≤ 𝑊)
15		ltrneq.l	. . . . . . . . . . . . . 14 ⊢ ≤ = (le‘𝐾)
16	10, 15, 2, 4	ltrnval1 40153	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ 𝐵 ∧ 𝑝 ≤ 𝑊)) → (𝐹‘𝑝) = 𝑝)
17	8, 9, 13, 14, 16	syl112anc 1376	. . . . . . . . . . . 12 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ≤ 𝑊) → (𝐹‘𝑝) = 𝑝)
18	17	ex 412	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) → (𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝))
19		pm2.61 192	. . . . . . . . . . 11 ⊢ ((𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) → ((¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) → (𝐹‘𝑝) = 𝑝))
20	18, 19	syl 17	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) → ((¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) → (𝐹‘𝑝) = 𝑝))
21	20	ralimdva 3152	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) → ∀𝑝 ∈ 𝐴 (𝐹‘𝑝) = 𝑝))
22	21	imp 406	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) → ∀𝑝 ∈ 𝐴 (𝐹‘𝑝) = 𝑝)
23	22	adantr 480	. . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) ∧ 𝑥 ∈ 𝐵) → ∀𝑝 ∈ 𝐴 (𝐹‘𝑝) = 𝑝)
24	10, 11, 3	lauteq 40114	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝐹 ∈ (LAut‘𝐾) ∧ 𝑥 ∈ 𝐵) ∧ ∀𝑝 ∈ 𝐴 (𝐹‘𝑝) = 𝑝) → (𝐹‘𝑥) = 𝑥)
25	1, 6, 7, 23, 24	syl31anc 1375	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = 𝑥)
26		fvresi 7165	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑥) = 𝑥)
27	26	adantl 481	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) ∧ 𝑥 ∈ 𝐵) → (( I ↾ 𝐵)‘𝑥) = 𝑥)
28	25, 27	eqtr4d 2773	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) ∧ 𝑥 ∈ 𝐵) → (𝐹‘𝑥) = (( I ↾ 𝐵)‘𝑥))
29	28	ralrimiva 3132	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) → ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (( I ↾ 𝐵)‘𝑥))
30	10, 2, 4	ltrn1o 40143	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:𝐵–1-1-onto→𝐵)
31	30	adantr 480	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) → 𝐹:𝐵–1-1-onto→𝐵)
32		f1ofn 6819	. . . . . 6 ⊢ (𝐹:𝐵–1-1-onto→𝐵 → 𝐹 Fn 𝐵)
33	31, 32	syl 17	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) → 𝐹 Fn 𝐵)
34		fnresi 6667	. . . . 5 ⊢ ( I ↾ 𝐵) Fn 𝐵
35		eqfnfv 7021	. . . . 5 ⊢ ((𝐹 Fn 𝐵 ∧ ( I ↾ 𝐵) Fn 𝐵) → (𝐹 = ( I ↾ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (( I ↾ 𝐵)‘𝑥)))
36	33, 34, 35	sylancl 586	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) → (𝐹 = ( I ↾ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) = (( I ↾ 𝐵)‘𝑥)))
37	29, 36	mpbird 257	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) → 𝐹 = ( I ↾ 𝐵))
38	37	ex 412	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) → 𝐹 = ( I ↾ 𝐵)))
39	12	adantl 481	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ 𝐵)
40		fvresi 7165	. . . . . 6 ⊢ (𝑝 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑝) = 𝑝)
41	39, 40	syl 17	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) → (( I ↾ 𝐵)‘𝑝) = 𝑝)
42		fveq1 6875	. . . . . 6 ⊢ (𝐹 = ( I ↾ 𝐵) → (𝐹‘𝑝) = (( I ↾ 𝐵)‘𝑝))
43	42	eqeq1d 2737	. . . . 5 ⊢ (𝐹 = ( I ↾ 𝐵) → ((𝐹‘𝑝) = 𝑝 ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝))
44	41, 43	syl5ibrcom 247	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) → (𝐹 = ( I ↾ 𝐵) → (𝐹‘𝑝) = 𝑝))
45	44	a1dd 50	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ 𝑝 ∈ 𝐴) → (𝐹 = ( I ↾ 𝐵) → (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)))
46	45	ralrimdva 3140	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝐹 = ( I ↾ 𝐵) → ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)))
47	38, 46	impbid 212	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) ↔ 𝐹 = ( I ↾ 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∀wral 3051   class class class wbr 5119   I cid 5547   ↾ cres 5656   Fn wfn 6526  –1-1-onto→wf1o 6530  ‘cfv 6531  Basecbs 17228  lecple 17278  Atomscatm 39281  HLchlt 39368  LHypclh 40003  LAutclaut 40004  LTrncltrn 40120

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729

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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8842  df-proset 18306  df-poset 18325  df-plt 18340  df-lub 18356  df-glb 18357  df-join 18358  df-meet 18359  df-p0 18435  df-lat 18442  df-clat 18509  df-oposet 39194  df-ol 39196  df-oml 39197  df-covers 39284  df-ats 39285  df-atl 39316  df-cvlat 39340  df-hlat 39369  df-laut 40008  df-ldil 40123  df-ltrn 40124

This theorem is referenced by:  ltrnnid  40155