Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ldilset Structured version   Visualization version   GIF version

Theorem ldilset 40864
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.
StepHypRef 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‘𝐾)
62, 3, 4, 5ldilfset 40863 . . . 4 (𝐾𝐶 → (LDil‘𝐾) = (𝑤𝐻 ↦ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥)}))
76fveq1d 6885 . . 3 (𝐾𝐶 → ((LDil‘𝐾)‘𝑊) = ((𝑤𝐻 ↦ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥)})‘𝑊))
8 breq2 5114 . . . . . . 7 (𝑤 = 𝑊 → (𝑥 𝑤𝑥 𝑊))
98imbi1d 344 . . . . . 6 (𝑤 = 𝑊 → ((𝑥 𝑤 → (𝑓𝑥) = 𝑥) ↔ (𝑥 𝑊 → (𝑓𝑥) = 𝑥)))
109ralbidv 3188 . . . . 5 (𝑤 = 𝑊 → (∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥) ↔ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)))
1110rabbidv 3423 . . . 4 (𝑤 = 𝑊 → {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥)} = {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)})
12 eqid 2763 . . . 4 (𝑤𝐻 ↦ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥)}) = (𝑤𝐻 ↦ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥)})
135fvexi 6897 . . . . 5 𝐼 ∈ V
1413rabex 5311 . . . 4 {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)} ∈ V
1511, 12, 14fvmpt 6991 . . 3 (𝑊𝐻 → ((𝑤𝐻 ↦ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥)})‘𝑊) = {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)})
167, 15sylan9eq 2818 . 2 ((𝐾𝐶𝑊𝐻) → ((LDil‘𝐾)‘𝑊) = {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)})
171, 16eqtrid 2810 1 ((𝐾𝐶𝑊𝐻) → 𝐷 = {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wral 3079  {crab 3416   class class class wbr 5110  cmpt 5193  cfv 6538  Basecbs 17270  lecple 17318  LHypclh 40739  LAutclaut 40740  LDilcldil 40855
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ldil 40859
This theorem is referenced by:  isldil  40865
  Copyright terms: Public domain W3C validator