Theorem isldil 40983

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.

Step	Hyp	Ref	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‘𝐾)‘𝑊)
6	1, 2, 3, 4, 5	ldilset 40982	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → 𝐷 = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)})
7	6	eleq2d 2846	. 2 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝐷 ↔ 𝐹 ∈ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)}))
8		fveq1 6877	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
9	8	eqeq1d 2762	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) = 𝑥 ↔ (𝐹‘𝑥) = 𝑥))
10	9	imbi2d 343	. . . 4 ⊢ (𝑓 = 𝐹 → ((𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥) ↔ (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥)))
11	10	ralbidv 3185	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥)))
12	11	elrab 3645	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)} ↔ (𝐹 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥)))
13	7, 12	bitrdi 290	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝐷 ↔ (𝐹 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  {crab 3412   class class class wbr 5103  ‘cfv 6533  Basecbs 17301  lecple 17349  LHypclh 40857  LAutclaut 40858  LDilcldil 40973

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 5251  ax-nul 5263  ax-pr 5398

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 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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ldil 40977

This theorem is used by:  ldillaut  40984  ldilval  40986  idldil  40987  ldilcnv  40988  ldilco  40989  cdleme50ldil  41421