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 40698
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 40697 . . 3 ((𝐾𝐶𝑊𝐻) → 𝐷 = {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)})
76eleq2d 2847 . 2 ((𝐾𝐶𝑊𝐻) → (𝐹𝐷𝐹 ∈ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)}))
8 fveq1 6862 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
98eqeq1d 2763 . . . . 5 (𝑓 = 𝐹 → ((𝑓𝑥) = 𝑥 ↔ (𝐹𝑥) = 𝑥))
109imbi2d 342 . . . 4 (𝑓 = 𝐹 → ((𝑥 𝑊 → (𝑓𝑥) = 𝑥) ↔ (𝑥 𝑊 → (𝐹𝑥) = 𝑥)))
1110ralbidv 3184 . . 3 (𝑓 = 𝐹 → (∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥) ↔ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥)))
1211elrab 3650 . 2 (𝐹 ∈ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)} ↔ (𝐹𝐼 ∧ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥)))
137, 12bitrdi 289 1 ((𝐾𝐶𝑊𝐻) → (𝐹𝐷 ↔ (𝐹𝐼 ∧ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  wral 3075  {crab 3413   class class class wbr 5099  cfv 6517  Basecbs 17228  lecple 17276  LHypclh 40572  LAutclaut 40573  LDilcldil 40688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-ldil 40692
This theorem is referenced by:  ldillaut  40699  ldilval  40701  idldil  40702  ldilcnv  40703  ldilco  40704  cdleme50ldil  41136
  Copyright terms: Public domain W3C validator