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

Theorem dilsetN 37283
Description: The set of dilations for a fiducial atom 𝐷. (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
dilset.a 𝐴 = (Atoms‘𝐾)
dilset.s 𝑆 = (PSubSp‘𝐾)
dilset.w 𝑊 = (WAtoms‘𝐾)
dilset.m 𝑀 = (PAut‘𝐾)
dilset.l 𝐿 = (Dil‘𝐾)
Assertion
Ref Expression
dilsetN ((𝐾𝐵𝐷𝐴) → (𝐿𝐷) = {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)})
Distinct variable groups:   𝑥,𝑓,𝐾   𝑓,𝑀   𝑥,𝑆   𝐷,𝑓,𝑥
Allowed substitution hints:   𝐴(𝑥,𝑓)   𝐵(𝑥,𝑓)   𝑆(𝑓)   𝐿(𝑥,𝑓)   𝑀(𝑥)   𝑊(𝑥,𝑓)

Proof of Theorem dilsetN
Dummy variable 𝑑 is distinct from all other variables.
StepHypRef Expression
1 dilset.a . . . 4 𝐴 = (Atoms‘𝐾)
2 dilset.s . . . 4 𝑆 = (PSubSp‘𝐾)
3 dilset.w . . . 4 𝑊 = (WAtoms‘𝐾)
4 dilset.m . . . 4 𝑀 = (PAut‘𝐾)
5 dilset.l . . . 4 𝐿 = (Dil‘𝐾)
61, 2, 3, 4, 5dilfsetN 37282 . . 3 (𝐾𝐵𝐿 = (𝑑𝐴 ↦ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥)}))
76fveq1d 6667 . 2 (𝐾𝐵 → (𝐿𝐷) = ((𝑑𝐴 ↦ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥)})‘𝐷))
8 fveq2 6665 . . . . . . 7 (𝑑 = 𝐷 → (𝑊𝑑) = (𝑊𝐷))
98sseq2d 3999 . . . . . 6 (𝑑 = 𝐷 → (𝑥 ⊆ (𝑊𝑑) ↔ 𝑥 ⊆ (𝑊𝐷)))
109imbi1d 344 . . . . 5 (𝑑 = 𝐷 → ((𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥) ↔ (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)))
1110ralbidv 3197 . . . 4 (𝑑 = 𝐷 → (∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥) ↔ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)))
1211rabbidv 3481 . . 3 (𝑑 = 𝐷 → {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥)} = {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)})
13 eqid 2821 . . 3 (𝑑𝐴 ↦ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥)}) = (𝑑𝐴 ↦ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥)})
144fvexi 6679 . . . 4 𝑀 ∈ V
1514rabex 5228 . . 3 {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)} ∈ V
1612, 13, 15fvmpt 6763 . 2 (𝐷𝐴 → ((𝑑𝐴 ↦ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥)})‘𝐷) = {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)})
177, 16sylan9eq 2876 1 ((𝐾𝐵𝐷𝐴) → (𝐿𝐷) = {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  wral 3138  {crab 3142  wss 3936  cmpt 5139  cfv 6350  Atomscatm 36393  PSubSpcpsubsp 36626  WAtomscwpointsN 37116  PAutcpautN 37117  DilcdilN 37232
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pr 5322
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-dilN 37236
This theorem is referenced by:  isdilN  37284
  Copyright terms: Public domain W3C validator