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

Theorem isdilN 40956
Description: The predicate "is a dilation". (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
isdilN ((𝐾𝐵𝐷𝐴) → (𝐹 ∈ (𝐿𝐷) ↔ (𝐹𝑀 ∧ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥))))
Distinct variable groups:   𝑥,𝐾   𝑥,𝑆   𝑥,𝐷   𝑥,𝐹
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐿(𝑥)   𝑀(𝑥)   𝑊(𝑥)

Proof of Theorem isdilN
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, 5dilsetN 40955 . . 3 ((𝐾𝐵𝐷𝐴) → (𝐿𝐷) = {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)})
76eleq2d 2848 . 2 ((𝐾𝐵𝐷𝐴) → (𝐹 ∈ (𝐿𝐷) ↔ 𝐹 ∈ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)}))
8 fveq1 6880 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
98eqeq1d 2764 . . . . 5 (𝑓 = 𝐹 → ((𝑓𝑥) = 𝑥 ↔ (𝐹𝑥) = 𝑥))
109imbi2d 343 . . . 4 (𝑓 = 𝐹 → ((𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥) ↔ (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥)))
1110ralbidv 3187 . . 3 (𝑓 = 𝐹 → (∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥) ↔ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥)))
1211elrab 3649 . 2 (𝐹 ∈ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)} ↔ (𝐹𝑀 ∧ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥)))
137, 12bitrdi 290 1 ((𝐾𝐵𝐷𝐴) → (𝐹 ∈ (𝐿𝐷) ↔ (𝐹𝑀 ∧ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400   = wceq 1569  wcel 2142  wral 3078  {crab 3415  wss 3904  cfv 6536  Atomscatm 40065  PSubSpcpsubsp 40298  WAtomscwpointsN 40788  PAutcpautN 40789  DilcdilN 40904
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-dilN 40908
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator