Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iinfconstbas Structured version   Visualization version   GIF version

Theorem iinfconstbas 50572
Description: The discrete category is the indexed intersection of all subcategories with the same base. (Contributed by Zhi Wang, 1-Nov-2025.)
Hypotheses
Ref Expression
discsubc.j 𝐽 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
discsubc.b 𝐵 = (Base‘𝐶)
discsubc.i 𝐼 = (Id‘𝐶)
discsubc.s (𝜑 → 𝑆 ⊆ 𝐵)
discsubc.c (𝜑 → 𝐶 ∈ Cat)
iinfconstbas.a (𝜑 → 𝐴 = ((Subcat‘𝐶) ∩ {𝑗 ∣ 𝑗 Fn (𝑆 × 𝑆)}))
Assertion
Ref Expression
iinfconstbas (𝜑 → 𝐽 = (𝑧 ∈ ∩ ℎ ∈ 𝐴 dom ℎ ↦ ∩ ℎ ∈ 𝐴 (ℎ‘𝑧)))
Distinct variable groups:   𝑥,𝑆,𝑦   𝑥,𝐼,𝑦   ℎ,𝐽,𝑗   𝑆,ℎ,𝑗   𝐴,ℎ,𝑥,𝑦,𝑧   ℎ,𝐼   𝑧,𝑆   𝜑,ℎ,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑧, 𝑗)   𝐴(𝑗)   𝐵(𝑥, 𝑦, 𝑧, ℎ, 𝑗)   𝐶(𝑥, 𝑦, 𝑧, ℎ, 𝑗)   𝐼(𝑧, 𝑗)   𝐽(𝑥, 𝑦, 𝑧)

Proof of Theorem iinfconstbas
StepHypRef Expression
1 discsubc.j . . 3 𝐽 = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
2 discsubc.b . . . . . . . 8 𝐵 = (Base‘𝐶)
3 discsubc.i . . . . . . . 8 𝐼 = (Id‘𝐶)
4 discsubc.s . . . . . . . 8 (𝜑 → 𝑆 ⊆ 𝐵)
5 discsubc.c . . . . . . . 8 (𝜑 → 𝐶 ∈ Cat)
6 iinfconstbas.a . . . . . . . 8 (𝜑 → 𝐴 = ((Subcat‘𝐶) ∩ {𝑗 ∣ 𝑗 Fn (𝑆 × 𝑆)}))
71, 2, 3, 4, 5, 6iinfconstbaslem 50571 . . . . . . 7 (𝜑 → 𝐽 ∈ 𝐴)
87ne0d 4291 . . . . . 6 (𝜑 → 𝐴 ≠ ∅)
9 iinconst 4967 . . . . . 6 (𝐴 ≠ ∅ → ∩ ℎ ∈ 𝐴 𝑆 = 𝑆)
108, 9syl 18 . . . . 5 (𝜑 → ∩ ℎ ∈ 𝐴 𝑆 = 𝑆)
1110eqcomd 2769 . . . 4 (𝜑 → 𝑆 = ∩ ℎ ∈ 𝐴 𝑆)
1211adantr 486 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑆 = ∩ ℎ ∈ 𝐴 𝑆)
137adantr 486 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝐽 ∈ 𝐴)
14 simpr 490 . . . . . . . 8 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ = 𝐽) → ℎ = 𝐽)
1514oveqd 7468 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ = 𝐽) → (𝑥ℎ𝑦) = (𝑥𝐽𝑦))
16 snex 5404 . . . . . . . . . 10 {(𝐼‘𝑥)} ∈ V
17 0ex 5267 . . . . . . . . . 10 ∅ ∈ V
1816, 17ifex 4536 . . . . . . . . 9 if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) ∈ V
191ovmpt4g 7599 . . . . . . . . 9 ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) ∈ V) → (𝑥𝐽𝑦) = if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
2018, 19mp3an3 1480 . . . . . . . 8 ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥𝐽𝑦) = if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
2120ad2antlr 740 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ = 𝐽) → (𝑥𝐽𝑦) = if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
2215, 21eqtrd 2798 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ = 𝐽) → (𝑥ℎ𝑦) = if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
23 sseq1 3938 . . . . . . 7 ({(𝐼‘𝑥)} = if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) → ({(𝐼‘𝑥)} ⊆ (𝑥ℎ𝑦) ↔ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) ⊆ (𝑥ℎ𝑦)))
24 sseq1 3938 . . . . . . 7 (∅ = if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) → (∅ ⊆ (𝑥ℎ𝑦) ↔ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) ⊆ (𝑥ℎ𝑦)))
25 simpr 490 . . . . . . . . . . . . . 14 ((𝜑 ∧ ℎ ∈ 𝐴) → ℎ ∈ 𝐴)
266adantr 486 . . . . . . . . . . . . . 14 ((𝜑 ∧ ℎ ∈ 𝐴) → 𝐴 = ((Subcat‘𝐶) ∩ {𝑗 ∣ 𝑗 Fn (𝑆 × 𝑆)}))
2725, 26eleqtrd 2866 . . . . . . . . . . . . 13 ((𝜑 ∧ ℎ ∈ 𝐴) → ℎ ∈ ((Subcat‘𝐶) ∩ {𝑗 ∣ 𝑗 Fn (𝑆 × 𝑆)}))
2827elin1d 4104 . . . . . . . . . . . 12 ((𝜑 ∧ ℎ ∈ 𝐴) → ℎ ∈ (Subcat‘𝐶))
2928adantlr 728 . . . . . . . . . . 11 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) → ℎ ∈ (Subcat‘𝐶))
3027elin2d 4105 . . . . . . . . . . . . 13 ((𝜑 ∧ ℎ ∈ 𝐴) → ℎ ∈ {𝑗 ∣ 𝑗 Fn (𝑆 × 𝑆)})
31 vex 3458 . . . . . . . . . . . . . 14 ℎ ∈ V
32 fneq1 6660 . . . . . . . . . . . . . 14 (𝑗 = ℎ → (𝑗 Fn (𝑆 × 𝑆) ↔ ℎ Fn (𝑆 × 𝑆)))
3331, 32elab 3636 . . . . . . . . . . . . 13 (ℎ ∈ {𝑗 ∣ 𝑗 Fn (𝑆 × 𝑆)} ↔ ℎ Fn (𝑆 × 𝑆))
3430, 33sylib 221 . . . . . . . . . . . 12 ((𝜑 ∧ ℎ ∈ 𝐴) → ℎ Fn (𝑆 × 𝑆))
3534adantlr 728 . . . . . . . . . . 11 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) → ℎ Fn (𝑆 × 𝑆))
36 simplrl 789 . . . . . . . . . . 11 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) → 𝑥 ∈ 𝑆)
3729, 35, 36, 3subcidcl 18069 . . . . . . . . . 10 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) → (𝐼‘𝑥) ∈ (𝑥ℎ𝑥))
3837adantr 486 . . . . . . . . 9 ((((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) ∧ 𝑥 = 𝑦) → (𝐼‘𝑥) ∈ (𝑥ℎ𝑥))
39 simpr 490 . . . . . . . . . 10 ((((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) ∧ 𝑥 = 𝑦) → 𝑥 = 𝑦)
4039oveq2d 7467 . . . . . . . . 9 ((((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) ∧ 𝑥 = 𝑦) → (𝑥ℎ𝑥) = (𝑥ℎ𝑦))
4138, 40eleqtrd 2866 . . . . . . . 8 ((((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) ∧ 𝑥 = 𝑦) → (𝐼‘𝑥) ∈ (𝑥ℎ𝑦))
4241snssd 4749 . . . . . . 7 ((((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) ∧ 𝑥 = 𝑦) → {(𝐼‘𝑥)} ⊆ (𝑥ℎ𝑦))
43 0ss 4353 . . . . . . . 8 ∅ ⊆ (𝑥ℎ𝑦)
4443a1i 11 . . . . . . 7 ((((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) ∧ ¬ 𝑥 = 𝑦) → ∅ ⊆ (𝑥ℎ𝑦))
4523, 24, 42, 44ifbothda 4524 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) ∧ ℎ ∈ 𝐴) → if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) ⊆ (𝑥ℎ𝑦))
4613, 22, 45iinglb 50325 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∩ ℎ ∈ 𝐴 (𝑥ℎ𝑦) = if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅))
4746eqcomd 2769 . . . 4 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅) = ∩ ℎ ∈ 𝐴 (𝑥ℎ𝑦))
4811, 12, 47mpoeq123dva 7525 . . 3 (𝜑 → (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝑦, {(𝐼‘𝑥)}, ∅)) = (𝑥 ∈ ∩ ℎ ∈ 𝐴 𝑆, 𝑦 ∈ ∩ ℎ ∈ 𝐴 𝑆 ↦ ∩ ℎ ∈ 𝐴 (𝑥ℎ𝑦)))
491, 48eqtrid 2810 . 2 (𝜑 → 𝐽 = (𝑥 ∈ ∩ ℎ ∈ 𝐴 𝑆, 𝑦 ∈ ∩ ℎ ∈ 𝐴 𝑆 ↦ ∩ ℎ ∈ 𝐴 (𝑥ℎ𝑦)))
50 eqid 2763 . . . 4 (Homf ‘𝐶) = (Homf ‘𝐶)
5128, 50subcssc 18065 . . 3 ((𝜑 ∧ ℎ ∈ 𝐴) → ℎ ⊆cat (Homf ‘𝐶))
52 eqidd 2764 . . 3 (𝜑 → (𝑧 ∈ ∩ ℎ ∈ 𝐴 dom ℎ ↦ ∩ ℎ ∈ 𝐴 (ℎ‘𝑧)) = (𝑧 ∈ ∩ ℎ ∈ 𝐴 dom ℎ ↦ ∩ ℎ ∈ 𝐴 (ℎ‘𝑧)))
53 dmdm 50559 . . . 4 (ℎ Fn (𝑆 × 𝑆) → 𝑆 = dom dom ℎ)
5434, 53syl 18 . . 3 ((𝜑 ∧ ℎ ∈ 𝐴) → 𝑆 = dom dom ℎ)
55 nfv 1949 . . 3 Ⅎℎ𝜑
568, 51, 52, 54, 55iinfssclem1 50560 . 2 (𝜑 → (𝑧 ∈ ∩ ℎ ∈ 𝐴 dom ℎ ↦ ∩ ℎ ∈ 𝐴 (ℎ‘𝑧)) = (𝑥 ∈ ∩ ℎ ∈ 𝐴 𝑆, 𝑦 ∈ ∩ ℎ ∈ 𝐴 𝑆 ↦ ∩ ℎ ∈ 𝐴 (𝑥ℎ𝑦)))
5749, 56eqtr4d 2801 1 (𝜑 → 𝐽 = (𝑧 ∈ ∩ ℎ ∈ 𝐴 dom ℎ ↦ ∩ ℎ ∈ 𝐴 (ℎ‘𝑧)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ifcif 4485  {csn 4588  ∩ ciin 4957   ↦ cmpt 5192   × cxp 5656  dom cdm 5658   Fn wfn 6561  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  Basecbs 17431  Catccat 17888  Idccid 17889  Homf chomf 17890  Subcatcsubc 18034
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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-rmo 3369  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 4841  df-uni 4873  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-pm 8888  df-ixp 8964  df-cat 17892  df-cid 17893  df-homf 17894  df-ssc 18035  df-subc 18037
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator