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 42201
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 42200 . . . 4 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)}))
98adantr 486 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐼 = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)}))
109fveq1d 6879 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = ((𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})‘𝑄))
11 simpr 490 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
12 breq1 5106 . . . . . 6 (𝑟 = 𝑄 → (𝑟 ≤ 𝑊 ↔ 𝑄 ≤ 𝑊))
1312notbid 321 . . . . 5 (𝑟 = 𝑄 → (¬ 𝑟 ≤ 𝑊 ↔ ¬ 𝑄 ≤ 𝑊))
1413elrab 3645 . . . 4 (𝑄 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↔ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
1511, 14sylibr 237 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝑄 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊})
16 eqeq2 2773 . . . . . . . . 9 (𝑞 = 𝑄 → ((𝑔‘𝑃) = 𝑞 ↔ (𝑔‘𝑃) = 𝑄))
1716riotabidv 7371 . . . . . . . 8 (𝑞 = 𝑄 → (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞) = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))
1817fveq2d 6881 . . . . . . 7 (𝑞 = 𝑄 → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
1918eqeq2d 2772 . . . . . 6 (𝑞 = 𝑄 → (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ↔ 𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
2019anbi1d 643 . . . . 5 (𝑞 = 𝑄 → ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸) ↔ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)))
2120opabbidv 5171 . . . 4 (𝑞 = 𝑄 → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)} = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
22 eqid 2761 . . . 4 (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)}) = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})
236fvexi 6891 . . . . . . . . . 10 𝐸 ∈ V
2423uniex 7747 . . . . . . . . 9 ∪ 𝐸 ∈ V
2524rnex 7911 . . . . . . . 8 ran ∪ 𝐸 ∈ V
2625uniex 7747 . . . . . . 7 ∪ ran ∪ 𝐸 ∈ V
2726pwex 5342 . . . . . 6 𝒫 ∪ ran ∪ 𝐸 ∈ V
2827, 23xpex 7756 . . . . 5 (𝒫 ∪ ran ∪ 𝐸 × 𝐸) ∈ V
29 simpl 488 . . . . . . . . 9 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
30 fvssunirn 6908 . . . . . . . . . . 11 (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ⊆ ∪ ran 𝑠
31 elssuni 4899 . . . . . . . . . . . . 13 (𝑠 ∈ 𝐸 → 𝑠 ⊆ ∪ 𝐸)
3231adantl 487 . . . . . . . . . . . 12 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑠 ⊆ ∪ 𝐸)
33 rnss 5921 . . . . . . . . . . . 12 (𝑠 ⊆ ∪ 𝐸 → ran 𝑠 ⊆ ran ∪ 𝐸)
34 uniss 4875 . . . . . . . . . . . 12 (ran 𝑠 ⊆ ran ∪ 𝐸 → ∪ ran 𝑠 ⊆ ∪ ran ∪ 𝐸)
3532, 33, 343syl 19 . . . . . . . . . . 11 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → ∪ ran 𝑠 ⊆ ∪ ran ∪ 𝐸)
3630, 35sstrid 3942 . . . . . . . . . 10 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ⊆ ∪ ran ∪ 𝐸)
3726elpw2 5296 . . . . . . . . . 10 ((𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∈ 𝒫 ∪ ran ∪ 𝐸 ↔ (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ⊆ ∪ ran ∪ 𝐸)
3836, 37sylibr 237 . . . . . . . . 9 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∈ 𝒫 ∪ ran ∪ 𝐸)
3929, 38eqeltrd 2861 . . . . . . . 8 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸)
40 simpr 490 . . . . . . . 8 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑠 ∈ 𝐸)
4139, 40jca 521 . . . . . . 7 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → (𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸 ∧ 𝑠 ∈ 𝐸))
4241ssopab2i 5525 . . . . . 6 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ⊆ {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸 ∧ 𝑠 ∈ 𝐸)}
43 df-xp 5657 . . . . . 6 (𝒫 ∪ ran ∪ 𝐸 × 𝐸) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸 ∧ 𝑠 ∈ 𝐸)}
4442, 43sseqtrri 3980 . . . . 5 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ⊆ (𝒫 ∪ ran ∪ 𝐸 × 𝐸)
4528, 44ssexi 5284 . . . 4 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ∈ V
4621, 22, 45fvmpt 6985 . . 3 (𝑄 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} → ((𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
4715, 46syl 18 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ((𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
4810, 47eqtrd 2796 1 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867   class class class wbr 5103  {copab 5167   ↦ cmpt 5186   × cxp 5649  ran crn 5652  ‘cfv 6531  ℩crio 7368  lecple 17415  occoc 17416  Atomscatm 40288  LHypclh 41009  LTrncltrn 41126  TEndoctendo 41777  DIsoCcdic 42197
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-dic 42198
This theorem is used by:  dicopelval  42202  dicelvalN  42203  dicval2  42204  dicfnN  42208  dicvalrelN  42210  dicssdvh  42211  dicelval1sta  42212  dihpN  42361
  Copyright terms: Public domain W3C validator