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

Theorem isldil 38103
Description: The predicate "is a lattice dilation". Similar to definition of dilation in [Crawley] p. 111. (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
isldil ((𝐾𝐶𝑊𝐻) → (𝐹𝐷 ↔ (𝐹𝐼 ∧ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥))))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐾   𝑥,𝑊   𝑥,𝐹
Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑥)   𝐻(𝑥)   𝐼(𝑥)   (𝑥)

Proof of Theorem isldil
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 ldilset.b . . . 4 𝐵 = (Base‘𝐾)
2 ldilset.l . . . 4 = (le‘𝐾)
3 ldilset.h . . . 4 𝐻 = (LHyp‘𝐾)
4 ldilset.i . . . 4 𝐼 = (LAut‘𝐾)
5 ldilset.d . . . 4 𝐷 = ((LDil‘𝐾)‘𝑊)
61, 2, 3, 4, 5ldilset 38102 . . 3 ((𝐾𝐶𝑊𝐻) → 𝐷 = {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)})
76eleq2d 2825 . 2 ((𝐾𝐶𝑊𝐻) → (𝐹𝐷𝐹 ∈ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)}))
8 fveq1 6767 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
98eqeq1d 2741 . . . . 5 (𝑓 = 𝐹 → ((𝑓𝑥) = 𝑥 ↔ (𝐹𝑥) = 𝑥))
109imbi2d 340 . . . 4 (𝑓 = 𝐹 → ((𝑥 𝑊 → (𝑓𝑥) = 𝑥) ↔ (𝑥 𝑊 → (𝐹𝑥) = 𝑥)))
1110ralbidv 3122 . . 3 (𝑓 = 𝐹 → (∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥) ↔ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥)))
1211elrab 3625 . 2 (𝐹 ∈ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)} ↔ (𝐹𝐼 ∧ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥)))
137, 12bitrdi 286 1 ((𝐾𝐶𝑊𝐻) → (𝐹𝐷 ↔ (𝐹𝐼 ∧ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1541  wcel 2109  wral 3065  {crab 3069   class class class wbr 5078  cfv 6430  Basecbs 16893  lecple 16950  LHypclh 37977  LAutclaut 37978  LDilcldil 38093
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pr 5355
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-ldil 38097
This theorem is referenced by:  ldillaut  38104  ldilval  38106  idldil  38107  ldilcnv  38108  ldilco  38109  cdleme50ldil  38541
  Copyright terms: Public domain W3C validator