Theorem diaelrnN 41905

Description: Any value of the partial isomorphism A is a set of translations i.e. a set of vectors. (Contributed by NM, 26-Nov-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
diaelrn.h	⊢ 𝐻 = (LHyp‘𝐾)
diaelrn.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
diaelrn.i	⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊)

Assertion

Ref	Expression
diaelrnN	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ ran 𝐼) → 𝑆 ⊆ 𝑇)

Proof of Theorem diaelrnN

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2762	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2762	. . . . 5 ⊢ (le‘𝐾) = (le‘𝐾)
3		diaelrn.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4		diaelrn.i	. . . . 5 ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊)
5	1, 2, 3, 4	diafn 41894	. . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 Fn {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊})
6		fvelrnb 6942	. . . 4 ⊢ (𝐼 Fn {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} → (𝑆 ∈ ran 𝐼 ↔ ∃𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} (𝐼‘𝑥) = 𝑆))
7	5, 6	syl 18	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ ran 𝐼 ↔ ∃𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} (𝐼‘𝑥) = 𝑆))
8		breq1 5110	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦(le‘𝐾)𝑊 ↔ 𝑥(le‘𝐾)𝑊))
9	8	elrab 3648	. . . . 5 ⊢ (𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊))
10		diaelrn.t	. . . . . . . 8 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
11	1, 2, 3, 10, 4	diass 41902	. . . . . . 7 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊)) → (𝐼‘𝑥) ⊆ 𝑇)
12	11	ex 418	. . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) → (𝐼‘𝑥) ⊆ 𝑇))
13		sseq1 3959	. . . . . . 7 ⊢ ((𝐼‘𝑥) = 𝑆 → ((𝐼‘𝑥) ⊆ 𝑇 ↔ 𝑆 ⊆ 𝑇))
14	13	biimpcd 252	. . . . . 6 ⊢ ((𝐼‘𝑥) ⊆ 𝑇 → ((𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇))
15	12, 14	syl6 36	. . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) → ((𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇)))
16	9, 15	biimtrid 245	. . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} → ((𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇)))
17	16	rexlimdv 3163	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (∃𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} (𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇))
18	7, 17	sylbid 243	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ ran 𝐼 → 𝑆 ⊆ 𝑇))
19	18	imp 412	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ ran 𝐼) → 𝑆 ⊆ 𝑇)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3088  {crab 3414   ⊆ wss 3902   class class class wbr 5107  ran crn 5660   Fn wfn 6532  ‘cfv 6537  Basecbs 17305  lecple 17353  LHypclh 40844  LTrncltrn 40961  DIsoAcdia 41888

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 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 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-disoa 41889

This theorem is used by:  dvadiaN  41988  djaclN  41996  djajN  41997