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

Theorem dicval 41177
Description: The partial isomorphism C for a lattice 𝐾. (Contributed by NM, 15-Dec-2013.) (Revised by Mario Carneiro, 22-Sep-2015.)
Hypotheses
Ref Expression
dicval.l = (le‘𝐾)
dicval.a 𝐴 = (Atoms‘𝐾)
dicval.h 𝐻 = (LHyp‘𝐾)
dicval.p 𝑃 = ((oc‘𝐾)‘𝑊)
dicval.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
dicval.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
dicval.i 𝐼 = ((DIsoC‘𝐾)‘𝑊)
Assertion
Ref Expression
dicval (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
Distinct variable groups:   𝑓,𝑔,𝑠,𝐾   𝑇,𝑔   𝑓,𝑊,𝑔,𝑠   𝑓,𝐸,𝑠   𝑃,𝑓   𝑄,𝑓,𝑔,𝑠   𝑇,𝑓
Allowed substitution hints:   𝐴(𝑓,𝑔,𝑠)   𝑃(𝑔,𝑠)   𝑇(𝑠)   𝐸(𝑔)   𝐻(𝑓,𝑔,𝑠)   𝐼(𝑓,𝑔,𝑠)   (𝑓,𝑔,𝑠)   𝑉(𝑓,𝑔,𝑠)

Proof of Theorem dicval
Dummy variables 𝑟 𝑞 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dicval.l . . . . 5 = (le‘𝐾)
2 dicval.a . . . . 5 𝐴 = (Atoms‘𝐾)
3 dicval.h . . . . 5 𝐻 = (LHyp‘𝐾)
4 dicval.p . . . . 5 𝑃 = ((oc‘𝐾)‘𝑊)
5 dicval.t . . . . 5 𝑇 = ((LTrn‘𝐾)‘𝑊)
6 dicval.e . . . . 5 𝐸 = ((TEndo‘𝐾)‘𝑊)
7 dicval.i . . . . 5 𝐼 = ((DIsoC‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7dicfval 41176 . . . 4 ((𝐾𝑉𝑊𝐻) → 𝐼 = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}))
98adantr 480 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐼 = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}))
109fveq1d 6863 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄))
11 simpr 484 . . . 4 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
12 breq1 5113 . . . . . 6 (𝑟 = 𝑄 → (𝑟 𝑊𝑄 𝑊))
1312notbid 318 . . . . 5 (𝑟 = 𝑄 → (¬ 𝑟 𝑊 ↔ ¬ 𝑄 𝑊))
1413elrab 3662 . . . 4 (𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↔ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
1511, 14sylibr 234 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊})
16 eqeq2 2742 . . . . . . . . 9 (𝑞 = 𝑄 → ((𝑔𝑃) = 𝑞 ↔ (𝑔𝑃) = 𝑄))
1716riotabidv 7349 . . . . . . . 8 (𝑞 = 𝑄 → (𝑔𝑇 (𝑔𝑃) = 𝑞) = (𝑔𝑇 (𝑔𝑃) = 𝑄))
1817fveq2d 6865 . . . . . . 7 (𝑞 = 𝑄 → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
1918eqeq2d 2741 . . . . . 6 (𝑞 = 𝑄 → (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ↔ 𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄))))
2019anbi1d 631 . . . . 5 (𝑞 = 𝑄 → ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸) ↔ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)))
2120opabbidv 5176 . . . 4 (𝑞 = 𝑄 → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)} = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
22 eqid 2730 . . . 4 (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}) = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})
236fvexi 6875 . . . . . . . . . 10 𝐸 ∈ V
2423uniex 7720 . . . . . . . . 9 𝐸 ∈ V
2524rnex 7889 . . . . . . . 8 ran 𝐸 ∈ V
2625uniex 7720 . . . . . . 7 ran 𝐸 ∈ V
2726pwex 5338 . . . . . 6 𝒫 ran 𝐸 ∈ V
2827, 23xpex 7732 . . . . 5 (𝒫 ran 𝐸 × 𝐸) ∈ V
29 simpl 482 . . . . . . . . 9 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
30 fvssunirn 6894 . . . . . . . . . . 11 (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝑠
31 elssuni 4904 . . . . . . . . . . . . 13 (𝑠𝐸𝑠 𝐸)
3231adantl 481 . . . . . . . . . . . 12 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑠 𝐸)
33 rnss 5906 . . . . . . . . . . . 12 (𝑠 𝐸 → ran 𝑠 ⊆ ran 𝐸)
34 uniss 4882 . . . . . . . . . . . 12 (ran 𝑠 ⊆ ran 𝐸 ran 𝑠 ran 𝐸)
3532, 33, 343syl 18 . . . . . . . . . . 11 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → ran 𝑠 ran 𝐸)
3630, 35sstrid 3961 . . . . . . . . . 10 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝐸)
3726elpw2 5292 . . . . . . . . . 10 ((𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∈ 𝒫 ran 𝐸 ↔ (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝐸)
3836, 37sylibr 234 . . . . . . . . 9 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∈ 𝒫 ran 𝐸)
3929, 38eqeltrd 2829 . . . . . . . 8 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑓 ∈ 𝒫 ran 𝐸)
40 simpr 484 . . . . . . . 8 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑠𝐸)
4139, 40jca 511 . . . . . . 7 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸))
4241ssopab2i 5513 . . . . . 6 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ⊆ {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸)}
43 df-xp 5647 . . . . . 6 (𝒫 ran 𝐸 × 𝐸) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸)}
4442, 43sseqtrri 3999 . . . . 5 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ⊆ (𝒫 ran 𝐸 × 𝐸)
4528, 44ssexi 5280 . . . 4 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ∈ V
4621, 22, 45fvmpt 6971 . . 3 (𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} → ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
4715, 46syl 17 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
4810, 47eqtrd 2765 1 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1540  wcel 2109  {crab 3408  wss 3917  𝒫 cpw 4566   cuni 4874   class class class wbr 5110  {copab 5172  cmpt 5191   × cxp 5639  ran crn 5642  cfv 6514  crio 7346  lecple 17234  occoc 17235  Atomscatm 39263  LHypclh 39985  LTrncltrn 40102  TEndoctendo 40753  DIsoCcdic 41173
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 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-dic 41174
This theorem is referenced by:  dicopelval  41178  dicelvalN  41179  dicval2  41180  dicfnN  41184  dicvalrelN  41186  dicssdvh  41187  dicelval1sta  41188  dihpN  41337
  Copyright terms: Public domain W3C validator