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 41546
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 41545 . . . 4 ((𝐾𝑉𝑊𝐻) → 𝐼 = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}))
98adantr 480 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐼 = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}))
109fveq1d 6844 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄))
11 simpr 484 . . . 4 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
12 breq1 5103 . . . . . 6 (𝑟 = 𝑄 → (𝑟 𝑊𝑄 𝑊))
1312notbid 318 . . . . 5 (𝑟 = 𝑄 → (¬ 𝑟 𝑊 ↔ ¬ 𝑄 𝑊))
1413elrab 3648 . . . 4 (𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↔ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
1511, 14sylibr 234 . . 3 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊})
16 eqeq2 2749 . . . . . . . . 9 (𝑞 = 𝑄 → ((𝑔𝑃) = 𝑞 ↔ (𝑔𝑃) = 𝑄))
1716riotabidv 7327 . . . . . . . 8 (𝑞 = 𝑄 → (𝑔𝑇 (𝑔𝑃) = 𝑞) = (𝑔𝑇 (𝑔𝑃) = 𝑄))
1817fveq2d 6846 . . . . . . 7 (𝑞 = 𝑄 → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
1918eqeq2d 2748 . . . . . 6 (𝑞 = 𝑄 → (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ↔ 𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄))))
2019anbi1d 632 . . . . 5 (𝑞 = 𝑄 → ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸) ↔ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)))
2120opabbidv 5166 . . . 4 (𝑞 = 𝑄 → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)} = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
22 eqid 2737 . . . 4 (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)}) = (𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})
236fvexi 6856 . . . . . . . . . 10 𝐸 ∈ V
2423uniex 7696 . . . . . . . . 9 𝐸 ∈ V
2524rnex 7862 . . . . . . . 8 ran 𝐸 ∈ V
2625uniex 7696 . . . . . . 7 ran 𝐸 ∈ V
2726pwex 5327 . . . . . 6 𝒫 ran 𝐸 ∈ V
2827, 23xpex 7708 . . . . 5 (𝒫 ran 𝐸 × 𝐸) ∈ V
29 simpl 482 . . . . . . . . 9 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)))
30 fvssunirn 6873 . . . . . . . . . . 11 (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝑠
31 elssuni 4896 . . . . . . . . . . . . 13 (𝑠𝐸𝑠 𝐸)
3231adantl 481 . . . . . . . . . . . 12 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑠 𝐸)
33 rnss 5896 . . . . . . . . . . . 12 (𝑠 𝐸 → ran 𝑠 ⊆ ran 𝐸)
34 uniss 4873 . . . . . . . . . . . 12 (ran 𝑠 ⊆ ran 𝐸 ran 𝑠 ran 𝐸)
3532, 33, 343syl 18 . . . . . . . . . . 11 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → ran 𝑠 ran 𝐸)
3630, 35sstrid 3947 . . . . . . . . . 10 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝐸)
3726elpw2 5281 . . . . . . . . . 10 ((𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∈ 𝒫 ran 𝐸 ↔ (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ⊆ ran 𝐸)
3836, 37sylibr 234 . . . . . . . . 9 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∈ 𝒫 ran 𝐸)
3929, 38eqeltrd 2837 . . . . . . . 8 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑓 ∈ 𝒫 ran 𝐸)
40 simpr 484 . . . . . . . 8 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → 𝑠𝐸)
4139, 40jca 511 . . . . . . 7 ((𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸) → (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸))
4241ssopab2i 5506 . . . . . 6 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ⊆ {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸)}
43 df-xp 5638 . . . . . 6 (𝒫 ran 𝐸 × 𝐸) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ran 𝐸𝑠𝐸)}
4442, 43sseqtrri 3985 . . . . 5 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ⊆ (𝒫 ran 𝐸 × 𝐸)
4528, 44ssexi 5269 . . . 4 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)} ∈ V
4621, 22, 45fvmpt 6949 . . 3 (𝑄 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} → ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
4715, 46syl 17 . 2 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ((𝑞 ∈ {𝑟𝐴 ∣ ¬ 𝑟 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑞)) ∧ 𝑠𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
4810, 47eqtrd 2772 1 (((𝐾𝑉𝑊𝐻) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → (𝐼𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(𝑔𝑇 (𝑔𝑃) = 𝑄)) ∧ 𝑠𝐸)})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  {crab 3401  wss 3903  𝒫 cpw 4556   cuni 4865   class class class wbr 5100  {copab 5162  cmpt 5181   × cxp 5630  ran crn 5633  cfv 6500  crio 7324  lecple 17196  occoc 17197  Atomscatm 39633  LHypclh 40354  LTrncltrn 40471  TEndoctendo 41122  DIsoCcdic 41542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-dic 41543
This theorem is referenced by:  dicopelval  41547  dicelvalN  41548  dicval2  41549  dicfnN  41553  dicvalrelN  41555  dicssdvh  41556  dicelval1sta  41557  dihpN  41706
  Copyright terms: Public domain W3C validator