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 41118
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 2740 . . . 4 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2740 . . . 4 (le‘𝐾) = (le‘𝐾)
3 dibcl.h . . . 4 𝐻 = (LHyp‘𝐾)
4 dibcl.i . . . 4 𝐼 = ((DIsoB‘𝐾)‘𝑊)
51, 2, 3, 4dibfnN 41113 . . 3 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊})
6 fnfun 6679 . . . 4 (𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} → Fun 𝐼)
7 funfn 6608 . . . 4 (Fun 𝐼𝐼 Fn dom 𝐼)
86, 7sylib 218 . . 3 (𝐼 Fn {𝑥 ∈ (Base‘𝐾) ∣ 𝑥(le‘𝐾)𝑊} → 𝐼 Fn dom 𝐼)
95, 8syl 17 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼 Fn dom 𝐼)
10 eqidd 2741 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ran 𝐼 = ran 𝐼)
111, 2, 3, 4dibeldmN 41115 . . . . 5 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑥 ∈ dom 𝐼 ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊)))
121, 2, 3, 4dibeldmN 41115 . . . . 5 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑦 ∈ dom 𝐼 ↔ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊)))
1311, 12anbi12d 631 . . . 4 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ((𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼) ↔ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) ∧ (𝑦 ∈ (Base‘𝐾) ∧ 𝑦(le‘𝐾)𝑊))))
141, 2, 3, 4dib11N 41117 . . . . . 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 3206 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∀𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦))
19 dff1o6 7311 . 2 (𝐼:dom 𝐼1-1-onto→ran 𝐼 ↔ (𝐼 Fn dom 𝐼 ∧ ran 𝐼 = ran 𝐼 ∧ ∀𝑥 ∈ dom 𝐼𝑦 ∈ dom 𝐼((𝐼𝑥) = (𝐼𝑦) → 𝑥 = 𝑦)))
209, 10, 18, 19syl3anbrc 1343 1 ((𝐾 ∈ HL ∧ 𝑊𝐻) → 𝐼:dom 𝐼1-1-onto→ran 𝐼)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1537  wcel 2108  wral 3067  {crab 3443   class class class wbr 5166  dom cdm 5700  ran crn 5701  Fun wfun 6567   Fn wfn 6568  1-1-ontowf1o 6572  cfv 6573  Basecbs 17258  lecple 17318  HLchlt 39306  LHypclh 39941  DIsoBcdib 41095
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-riotaBAD 38909
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-iin 5018  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-undef 8314  df-map 8886  df-proset 18365  df-poset 18383  df-plt 18400  df-lub 18416  df-glb 18417  df-join 18418  df-meet 18419  df-p0 18495  df-p1 18496  df-lat 18502  df-clat 18569  df-oposet 39132  df-ol 39134  df-oml 39135  df-covers 39222  df-ats 39223  df-atl 39254  df-cvlat 39278  df-hlat 39307  df-llines 39455  df-lplanes 39456  df-lvols 39457  df-lines 39458  df-psubsp 39460  df-pmap 39461  df-padd 39753  df-lhyp 39945  df-laut 39946  df-ldil 40061  df-ltrn 40062  df-trl 40116  df-disoa 40986  df-dib 41096
This theorem is referenced by:  dibintclN  41124
  Copyright terms: Public domain W3C validator