Theorem isldil 41433

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 41432	. . 3 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → 𝐷 = {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)})
7	6	eleq2d 2850	. 2 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝐷 ↔ 𝐹 ∈ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)}))
8		fveq1 6915	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
9	8	eqeq1d 2765	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) = 𝑥 ↔ (𝐹‘𝑥) = 𝑥))
10	9	imbi2d 343	. . . 4 ⊢ (𝑓 = 𝐹 → ((𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥) ↔ (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥)))
11	10	ralbidv 3189	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥)))
12	11	elrab 3648	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ 𝐼 ∣ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝑓‘𝑥) = 𝑥)} ↔ (𝐹 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥)))
13	7, 12	bitrdi 290	1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝐷 ↔ (𝐹 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑊 → (𝐹‘𝑥) = 𝑥))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   class class class wbr 5108  ‘cfv 6566  Basecbs 17431  lecple 17479  LHypclh 41307  LAutclaut 41308  LDilcldil 41423

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 5238  ax-sep 5255  ax-nul 5266  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 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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ldil 41427

This theorem is used by:  ldillaut  41434  ldilval  41436  idldil  41437  ldilcnv  41438  ldilco  41439  cdleme50ldil  41871