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 42425
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 42424 . . . 4 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)}))
98adantr 486 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐼 = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)}))
109fveq1d 6910 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = ((𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})‘𝑄))
11 simpr 490 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
12 breq1 5109 . . . . . 6 (𝑟 = 𝑄 → (𝑟 ≤ 𝑊 ↔ 𝑄 ≤ 𝑊))
1312notbid 321 . . . . 5 (𝑟 = 𝑄 → (¬ 𝑟 ≤ 𝑊 ↔ ¬ 𝑄 ≤ 𝑊))
1413elrab 3648 . . . 4 (𝑄 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↔ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
1511, 14sylibr 237 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝑄 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊})
16 eqeq2 2775 . . . . . . . . 9 (𝑞 = 𝑄 → ((𝑔‘𝑃) = 𝑞 ↔ (𝑔‘𝑃) = 𝑄))
1716riotabidv 7402 . . . . . . . 8 (𝑞 = 𝑄 → (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞) = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))
1817fveq2d 6912 . . . . . . 7 (𝑞 = 𝑄 → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
1918eqeq2d 2774 . . . . . 6 (𝑞 = 𝑄 → (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ↔ 𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
2019anbi1d 643 . . . . 5 (𝑞 = 𝑄 → ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸) ↔ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)))
2120opabbidv 5174 . . . 4 (𝑞 = 𝑄 → {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)} = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
22 eqid 2763 . . . 4 (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)}) = (𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})
236fvexi 6922 . . . . . . . . . 10 𝐸 ∈ V
2423uniex 7782 . . . . . . . . 9 ∪ 𝐸 ∈ V
2524rnex 7946 . . . . . . . 8 ran ∪ 𝐸 ∈ V
2625uniex 7782 . . . . . . 7 ∪ ran ∪ 𝐸 ∈ V
2726pwex 5346 . . . . . 6 𝒫 ∪ ran ∪ 𝐸 ∈ V
2827, 23xpex 7791 . . . . 5 (𝒫 ∪ ran ∪ 𝐸 × 𝐸) ∈ V
29 simpl 488 . . . . . . . . 9 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
30 fvssunirn 6939 . . . . . . . . . . 11 (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ⊆ ∪ ran 𝑠
31 elssuni 4902 . . . . . . . . . . . . 13 (𝑠 ∈ 𝐸 → 𝑠 ⊆ ∪ 𝐸)
3231adantl 487 . . . . . . . . . . . 12 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑠 ⊆ ∪ 𝐸)
33 rnss 5928 . . . . . . . . . . . 12 (𝑠 ⊆ ∪ 𝐸 → ran 𝑠 ⊆ ran ∪ 𝐸)
34 uniss 4878 . . . . . . . . . . . 12 (ran 𝑠 ⊆ ran ∪ 𝐸 → ∪ ran 𝑠 ⊆ ∪ ran ∪ 𝐸)
3532, 33, 343syl 19 . . . . . . . . . . 11 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → ∪ ran 𝑠 ⊆ ∪ ran ∪ 𝐸)
3630, 35sstrid 3924 . . . . . . . . . 10 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ⊆ ∪ ran ∪ 𝐸)
3726elpw2 5300 . . . . . . . . . 10 ((𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∈ 𝒫 ∪ ran ∪ 𝐸 ↔ (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ⊆ ∪ ran ∪ 𝐸)
3836, 37sylibr 237 . . . . . . . . 9 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∈ 𝒫 ∪ ran ∪ 𝐸)
3929, 38eqeltrd 2864 . . . . . . . 8 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸)
40 simpr 490 . . . . . . . 8 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → 𝑠 ∈ 𝐸)
4139, 40jca 521 . . . . . . 7 ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) → (𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸 ∧ 𝑠 ∈ 𝐸))
4241ssopab2i 5529 . . . . . 6 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ⊆ {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸 ∧ 𝑠 ∈ 𝐸)}
43 df-xp 5661 . . . . . 6 (𝒫 ∪ ran ∪ 𝐸 × 𝐸) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 ∈ 𝒫 ∪ ran ∪ 𝐸 ∧ 𝑠 ∈ 𝐸)}
4442, 43sseqtrri 3962 . . . . 5 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ⊆ (𝒫 ∪ ran ∪ 𝐸 × 𝐸)
4528, 44ssexi 5288 . . . 4 {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ∈ V
4621, 22, 45fvmpt 7016 . . 3 (𝑄 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} → ((𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
4715, 46syl 18 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ((𝑞 ∈ {𝑟 ∈ 𝐴 ∣ ¬ 𝑟 ≤ 𝑊} ↦ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑞)) ∧ 𝑠 ∈ 𝐸)})‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
4810, 47eqtrd 2798 1 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900  𝒫 cpw 4560  ∪ cuni 4870   class class class wbr 5106  {copab 5170   ↦ cmpt 5189   × cxp 5653  ran crn 5656  ‘cfv 6558  ℩crio 7399  lecple 17464  occoc 17465  Atomscatm 40512  LHypclh 41233  LTrncltrn 41350  TEndoctendo 42001  DIsoCcdic 42421
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-dic 42422
This theorem is used by:  dicopelval  42426  dicelvalN  42427  dicval2  42428  dicfnN  42432  dicvalrelN  42434  dicssdvh  42435  dicelval1sta  42436  dihpN  42585
  Copyright terms: Public domain W3C validator