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 41180
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 2735 . . . 4 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2735 . . . 4 (le‘𝐾) = (le‘𝐾)
3 dibcl.h . . . 4 𝐻 = (LHyp‘𝐾)
4 dibcl.i . . . 4 𝐼 = ((DIsoB‘𝐾)‘𝑊)
51, 2, 3, 4dibfnN 41175 . . 3 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
6 fnfun 6638 . . . 4 (𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} → Fun 𝐼)
7 funfn 6566 . . . 4 (Fun 𝐼𝐼 Fn dom 𝐼)
86, 7sylib 218 . . 3 (𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} → 𝐼 Fn dom 𝐼)
95, 8syl 17 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼 Fn dom 𝐼)
10 eqidd 2736 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ran 𝐼 = ran 𝐼)
111, 2, 3, 4dibeldmN 41177 . . . . 5 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑥 ∈ dom 𝐼 ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊)))
121, 2, 3, 4dibeldmN 41177 . . . . 5 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
1311, 12anbi12d 632 . . . 4 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ((𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼) ↔ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) ∧ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊))))
141, 2, 3, 4dib11N 41179 . . . . . 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 3185 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∀𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦))
19 dff1o6 7268 . 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 2108  wral 3051  {crab 3415   class class class wbr 5119  dom cdm 5654  ran crn 5655  Fun wfun 6525   Fn wfn 6526  1-1-ontowf1o 6530  cfv 6531  Basecbs 17228  lecple 17278  HLchlt 39368  LHypclh 40003  DIsoBcdib 41157
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-riotaBAD 38971
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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-iin 4970  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7988  df-2nd 7989  df-undef 8272  df-map 8842  df-proset 18306  df-poset 18325  df-plt 18340  df-lub 18356  df-glb 18357  df-join 18358  df-meet 18359  df-p0 18435  df-p1 18436  df-lat 18442  df-clat 18509  df-oposet 39194  df-ol 39196  df-oml 39197  df-covers 39284  df-ats 39285  df-atl 39316  df-cvlat 39340  df-hlat 39369  df-llines 39517  df-lplanes 39518  df-lvols 39519  df-lines 39520  df-psubsp 39522  df-pmap 39523  df-padd 39815  df-lhyp 40007  df-laut 40008  df-ldil 40123  df-ltrn 40124  df-trl 40178  df-disoa 41048  df-dib 41158
This theorem is referenced by:  dibintclN  41186
  Copyright terms: Public domain W3C validator