Theorem ldilfset 40607

Description: The mapping from fiducial co-atom 𝑤 to its set of lattice dilations. (Contributed by NM, 11-May-2012.)

Hypotheses

Ref	Expression
ldilset.b	⊢ 𝐵 = (Base‘𝐾)
ldilset.l	⊢ ≤ = (le‘𝐾)
ldilset.h	⊢ 𝐻 = (LHyp‘𝐾)
ldilset.i	⊢ 𝐼 = (LAut‘𝐾)

Assertion

Ref	Expression
ldilfset	⊢ (𝐾 ∈ 𝐶 → (LDil‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)}))

Distinct variable groups:   𝑥,𝐵   𝑤,𝐻   𝑓,𝐼   𝑤,𝑓,𝑥,𝐾

Allowed substitution hints:   𝐵(𝑤,𝑓)   𝐶(𝑥,𝑤,𝑓)   𝐻(𝑥,𝑓)   𝐼(𝑥,𝑤)   ≤ (𝑥,𝑤,𝑓)

Proof of Theorem ldilfset

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3453	. 2 ⊢ (𝐾 ∈ 𝐶 → 𝐾 ∈ V)
2		fveq2 6834	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		ldilset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2793	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6834	. . . . . 6 ⊢ (𝑘 = 𝐾 → (LAut‘𝑘) = (LAut‘𝐾))
6		ldilset.i	. . . . . 6 ⊢ 𝐼 = (LAut‘𝐾)
7	5, 6	eqtr4di 2793	. . . . 5 ⊢ (𝑘 = 𝐾 → (LAut‘𝑘) = 𝐼)
8		fveq2 6834	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
9		ldilset.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
10	8, 9	eqtr4di 2793	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
11		fveq2 6834	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
12		ldilset.l	. . . . . . . . 9 ⊢ ≤ = (le‘𝐾)
13	11, 12	eqtr4di 2793	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
14	13	breqd 5090	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑤 ↔ 𝑥 ≤ 𝑤))
15	14	imbi1d 342	. . . . . 6 ⊢ (𝑘 = 𝐾 → ((𝑥(le‘𝑘)𝑤 → (𝑓‘𝑥) = 𝑥) ↔ (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)))
16	10, 15	raleqbidv 3314	. . . . 5 ⊢ (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑤 → (𝑓‘𝑥) = 𝑥) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)))
17	7, 16	rabeqbidv 3410	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑓 ∈ (LAut‘𝑘) ∣ ∀𝑥 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑤 → (𝑓‘𝑥) = 𝑥)} = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)})
18	4, 17	mpteq12dv 5166	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑓 ∈ (LAut‘𝑘) ∣ ∀𝑥 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑤 → (𝑓‘𝑥) = 𝑥)}) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)}))
19		df-ldil 40603	. . 3 ⊢ LDil = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑓 ∈ (LAut‘𝑘) ∣ ∀𝑥 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑤 → (𝑓‘𝑥) = 𝑥)}))
20	18, 19, 3	mptfvmpt 7179	. 2 ⊢ (𝐾 ∈ V → (LDil‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)}))
21	1, 20	syl 17	1 ⊢ (𝐾 ∈ 𝐶 → (LDil‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)}))

Syntax hints:   → wi 4   = wceq 1547   ∈ wcel 2119  ∀wral 3054  {crab 3392  Vcvv 3432   class class class wbr 5079   ↦ cmpt 5160  ‘cfv 6492  Basecbs 17177  lecple 17225  LHypclh 40483  LAutclaut 40484  LDilcldil 40599

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ldil 40603

This theorem is referenced by:  ldilset  40608