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 41402
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 41401 . . 3 ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐿‘𝐷) = {𝑓 ∈ 𝑀 ∣ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥)})
76eleq2d 2850 . 2 ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝐿‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ 𝑀 ∣ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥)}))
8 fveq1 6904 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
98eqeq1d 2765 . . . . 5 (𝑓 = 𝐹 → ((𝑓‘𝑥) = 𝑥 ↔ (𝐹‘𝑥) = 𝑥))
109imbi2d 343 . . . 4 (𝑓 = 𝐹 → ((𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥) ↔ (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥)))
1110ralbidv 3189 . . 3 (𝑓 = 𝐹 → (∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥) ↔ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥)))
1211elrab 3648 . 2 (𝐹 ∈ {𝑓 ∈ 𝑀 ∣ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥)} ↔ (𝐹 ∈ 𝑀 ∧ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥)))
137, 12bitrdi 290 1 ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝐿‘𝐷) ↔ (𝐹 ∈ 𝑀 ∧ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900  ‘cfv 6555  Atomscatm 40511  PSubSpcpsubsp 40744  WAtomscwpointsN 41234  PAutcpautN 41235  DilcdilN 41350
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-dilN 41354
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator