Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dibf11N Structured version   Visualization version   GIF version

Theorem dibf11N 41143
Description: The partial isomorphism A for a lattice 𝐾 is a one-to-one function. Part of Lemma M of [Crawley] p. 120 line 27. (Contributed by NM, 4-Dec-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
dibcl.h 𝐻 = (LHyp‘𝐾)
dibcl.i 𝐼 = ((DIsoB‘𝐾)‘𝑊)
Assertion
Ref Expression
dibf11N ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼:dom 𝐼1-1-onto→ran 𝐼)

Proof of Theorem dibf11N
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2729 . . . 4 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2729 . . . 4 (le‘𝐾) = (le‘𝐾)
3 dibcl.h . . . 4 𝐻 = (LHyp‘𝐾)
4 dibcl.i . . . 4 𝐼 = ((DIsoB‘𝐾)‘𝑊)
51, 2, 3, 4dibfnN 41138 . . 3 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
6 fnfun 6586 . . . 4 (𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} → Fun 𝐼)
7 funfn 6516 . . . 4 (Fun 𝐼𝐼 Fn dom 𝐼)
86, 7sylib 218 . . 3 (𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} → 𝐼 Fn dom 𝐼)
95, 8syl 17 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼 Fn dom 𝐼)
10 eqidd 2730 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ran 𝐼 = ran 𝐼)
111, 2, 3, 4dibeldmN 41140 . . . . 5 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑥 ∈ dom 𝐼 ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊)))
121, 2, 3, 4dibeldmN 41140 . . . . 5 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
1311, 12anbi12d 632 . . . 4 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ((𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼) ↔ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) ∧ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊))))
141, 2, 3, 4dib11N 41142 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) ∧ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)) → ((𝐼𝑥) = (𝐼𝑦) ↔ 𝑥 = 𝑦))
1514biimpd 229 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) ∧ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)) → ((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦))
16153expib 1122 . . . 4 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) ∧ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)) → ((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦)))
1713, 16sylbid 240 . . 3 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ((𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼) → ((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦)))
1817ralrimivv 3170 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∀𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦))
19 dff1o6 7216 . 2 (𝐼:dom 𝐼1-1-onto→ran 𝐼 ↔ (𝐼 Fn dom 𝐼 ∧ ran 𝐼 = ran 𝐼 ∧ ∀𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦)))
209, 10, 18, 19syl3anbrc 1344 1 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼:dom 𝐼1-1-onto→ran 𝐼)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3044  {crab 3396   class class class wbr 5095  dom cdm 5623  ran crn 5624  Fun wfun 6480   Fn wfn 6481  1-1-ontowf1o 6485  cfv 6486  Basecbs 17138  lecple 17186  HLchlt 39331  LHypclh 39966  DIsoBcdib 41120
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-riotaBAD 38934
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-iin 4947  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-1st 7931  df-2nd 7932  df-undef 8213  df-map 8762  df-proset 18218  df-poset 18237  df-plt 18252  df-lub 18268  df-glb 18269  df-join 18270  df-meet 18271  df-p0 18347  df-p1 18348  df-lat 18356  df-clat 18423  df-oposet 39157  df-ol 39159  df-oml 39160  df-covers 39247  df-ats 39248  df-atl 39279  df-cvlat 39303  df-hlat 39332  df-llines 39480  df-lplanes 39481  df-lvols 39482  df-lines 39483  df-psubsp 39485  df-pmap 39486  df-padd 39778  df-lhyp 39970  df-laut 39971  df-ldil 40086  df-ltrn 40087  df-trl 40141  df-disoa 41011  df-dib 41121
This theorem is referenced by:  dibintclN  41149
  Copyright terms: Public domain W3C validator