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 41928
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 41927 . . . 4 ((𝐾𝑉𝑊𝐻) → 𝐼 = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}))
98adantr 485 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐼 = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}))
109fveq1d 6885 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄))
11 simpr 489 . . . 4 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
12 breq1 5113 . . . . . 6 (𝑟 = 𝑄 → (𝑟 𝑊𝑄 𝑊))
1312notbid 321 . . . . 5 (𝑟 = 𝑄 → (¬ 𝑟 𝑊 ↔ ¬ 𝑄 𝑊))
1413elrab 3651 . . . 4 (𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↔ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
1511, 14sylibr 237 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊})
16 eqeq2 2775 . . . . . . . . 9 (𝑞 = 𝑄 → ((𝑔𝑃) = 𝑞 ↔ (𝑔𝑃) = 𝑄))
1716riotabidv 7371 . . . . . . . 8 (𝑞 = 𝑄 → (𝑔𝑇 (𝑔𝑃) = 𝑞) = (𝑔𝑇 (𝑔𝑃) = 𝑄))
1817fveq2d 6887 . . . . . . 7 (𝑞 = 𝑄 → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
1918eqeq2d 2774 . . . . . 6 (𝑞 = 𝑄 → (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ↔ 𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄))))
2019anbi1d 642 . . . . 5 (𝑞 = 𝑄 → ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸) ↔ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)))
2120opabbidv 5178 . . . 4 (𝑞 = 𝑄 → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)} = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
22 eqid 2763 . . . 4 (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}) = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})
236fvexi 6897 . . . . . . . . . 10 𝐸 ∈ V
2423uniex 7741 . . . . . . . . 9 𝐸 ∈ V
2524rnex 7908 . . . . . . . 8 ran 𝐸 ∈ V
2625uniex 7741 . . . . . . 7 ran 𝐸 ∈ V
2726pwex 5353 . . . . . 6 𝒫 ran 𝐸 ∈ V
2827, 23xpex 7753 . . . . 5 (𝒫 ran 𝐸 × 𝐸) ∈ V
29 simpl 487 . . . . . . . . 9 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
30 fvssunirn 6914 . . . . . . . . . . 11 (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝑠
31 elssuni 4905 . . . . . . . . . . . . 13 (𝑠𝐸𝑠 𝐸)
3231adantl 486 . . . . . . . . . . . 12 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑠 𝐸)
33 rnss 5931 . . . . . . . . . . . 12 (𝑠 𝐸 → ran 𝑠 ⊆ ran 𝐸)
34 uniss 4881 . . . . . . . . . . . 12 (ran 𝑠 ⊆ ran 𝐸 ran 𝑠 ran 𝐸)
3532, 33, 343syl 19 . . . . . . . . . . 11 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → ran 𝑠 ran 𝐸)
3630, 35sstrid 3949 . . . . . . . . . 10 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝐸)
3726elpw2 5306 . . . . . . . . . 10 ((𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∈ 𝒫 ran 𝐸 ↔ (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝐸)
3836, 37sylibr 237 . . . . . . . . 9 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∈ 𝒫 ran 𝐸)
3929, 38eqeltrd 2863 . . . . . . . 8 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑓 ∈ 𝒫 ran 𝐸)
40 simpr 489 . . . . . . . 8 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑠𝐸)
4139, 40jca 520 . . . . . . 7 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸))
4241ssopab2i 5537 . . . . . 6 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ⊆ {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸)}
43 df-xp 5669 . . . . . 6 (𝒫 ran 𝐸 × 𝐸) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸)}
4442, 43sseqtrri 3987 . . . . 5 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ⊆ (𝒫 ran 𝐸 × 𝐸)
4528, 44ssexi 5294 . . . 4 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ∈ V
4621, 22, 45fvmpt 6991 . . 3 (𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} → ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
4715, 46syl 18 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
4810, 47eqtrd 2798 1 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400   = wceq 1570  wcel 2143  {crab 3416  wss 3906  𝒫 cpw 4563   cuni 4873   class class class wbr 5110  {copab 5174  cmpt 5193   × cxp 5661  ran crn 5664  cfv 6538  crio 7368  lecple 17318  occoc 17319  Atomscatm 40015  LHypclh 40736  LTrncltrn 40853  TEndoctendo 41504  DIsoCcdic 41924
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7369  df-dic 41925
This theorem is referenced by:  dicopelval  41929  dicelvalN  41930  dicval2  41931  dicfnN  41935  dicvalrelN  41937  dicssdvh  41938  dicelval1sta  41939  dihpN  42088
  Copyright terms: Public domain W3C validator