Theorem ldilset 41369

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

Hypotheses

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

Assertion

Ref	Expression
ldilset	⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → 𝐷 = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)})

Distinct variable groups:   𝑥,𝐵   𝑓,𝐼   𝑥,𝑓,𝐾   𝑓,𝑊,𝑥

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

Proof of Theorem ldilset

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ldilset.d	. 2 ⊢ 𝐷 = ((LDil‘𝐾)‘𝑊)
2		ldilset.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
3		ldilset.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
4		ldilset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
5		ldilset.i	. . . . 5 ⊢ 𝐼 = (LAut‘𝐾)
6	2, 3, 4, 5	ldilfset 41368	. . . 4 ⊢ (𝐾 ∈ 𝐶 → (LDil‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)}))
7	6	fveq1d 6913	. . 3 ⊢ (𝐾 ∈ 𝐶 → ((LDil‘𝐾)‘𝑊) = ((𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)})‘𝑊))
8		breq2 5110	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑥 ≤ 𝑤 ↔ 𝑥 ≤ 𝑊))
9	8	imbi1d 344	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥) ↔ (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)))
10	9	ralbidv 3189	. . . . 5 ⊢ (𝑤 = 𝑊 → (∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)))
11	10	rabbidv 3423	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)} = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)})
12		eqid 2763	. . . 4 ⊢ (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)}) = (𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)})
13	5	fvexi 6925	. . . . 5 ⊢ 𝐼 ∈ V
14	13	rabex 5305	. . . 4 ⊢ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)} ∈ V
15	11, 12, 14	fvmpt 7019	. . 3 ⊢ (𝑊 ∈ 𝐻 → ((𝑤 ∈ 𝐻 ↦ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑤 → (𝑓‘𝑥) = 𝑥)})‘𝑊) = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)})
16	7, 15	sylan9eq 2818	. 2 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → ((LDil‘𝐾)‘𝑊) = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)})
17	1, 16	eqtrid 2810	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → 𝐷 = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   class class class wbr 5106   ↦ cmpt 5190  ‘cfv 6561  Basecbs 17419  lecple 17467  LHypclh 41244  LAutclaut 41245  LDilcldil 41360

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ldil 41364

This theorem is used by:  isldil  41370