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 41125
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 41124 . . 3 ((𝐾𝐵𝐷𝐴) → (𝐿𝐷) = {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)})
76eleq2d 2846 . 2 ((𝐾𝐵𝐷𝐴) → (𝐹 ∈ (𝐿𝐷) ↔ 𝐹 ∈ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)}))
8 fveq1 6873 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
98eqeq1d 2762 . . . . 5 (𝑓 = 𝐹 → ((𝑓𝑥) = 𝑥 ↔ (𝐹𝑥) = 𝑥))
109imbi2d 343 . . . 4 (𝑓 = 𝐹 → ((𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥) ↔ (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥)))
1110ralbidv 3185 . . 3 (𝑓 = 𝐹 → (∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥) ↔ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥)))
1211elrab 3645 . 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 2145  wral 3076  {crab 3412  wss 3899  cfv 6528  Atomscatm 40234  PSubSpcpsubsp 40467  WAtomscwpointsN 40957  PAutcpautN 40958  DilcdilN 41073
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-dilN 41077
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator