MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  wunfunc Structured version   Visualization version   GIF version

Theorem wunfunc 17805
Description: A weak universe is closed under the functor set operation. (Contributed by Mario Carneiro, 12-Jan-2017.) (Proof shortened by AV, 13-Oct-2024.)
Hypotheses
Ref Expression
wunfunc.1 (𝜑𝑈 ∈ WUni)
wunfunc.2 (𝜑𝐶𝑈)
wunfunc.3 (𝜑𝐷𝑈)
Assertion
Ref Expression
wunfunc (𝜑 → (𝐶 Func 𝐷) ∈ 𝑈)

Proof of Theorem wunfunc
Dummy variables 𝑓 𝑔 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wunfunc.1 . 2 (𝜑𝑈 ∈ WUni)
2 baseid 17120 . . . . 5 Base = Slot (Base‘ndx)
3 wunfunc.3 . . . . 5 (𝜑𝐷𝑈)
42, 1, 3wunstr 17096 . . . 4 (𝜑 → (Base‘𝐷) ∈ 𝑈)
5 wunfunc.2 . . . . 5 (𝜑𝐶𝑈)
62, 1, 5wunstr 17096 . . . 4 (𝜑 → (Base‘𝐶) ∈ 𝑈)
71, 4, 6wunmap 10614 . . 3 (𝜑 → ((Base‘𝐷) ↑m (Base‘𝐶)) ∈ 𝑈)
8 homid 17313 . . . . . . . . 9 Hom = Slot (Hom ‘ndx)
98, 1, 5wunstr 17096 . . . . . . . 8 (𝜑 → (Hom ‘𝐶) ∈ 𝑈)
101, 9wunrn 10617 . . . . . . 7 (𝜑 → ran (Hom ‘𝐶) ∈ 𝑈)
111, 10wununi 10594 . . . . . 6 (𝜑 ran (Hom ‘𝐶) ∈ 𝑈)
128, 1, 3wunstr 17096 . . . . . . . 8 (𝜑 → (Hom ‘𝐷) ∈ 𝑈)
131, 12wunrn 10617 . . . . . . 7 (𝜑 → ran (Hom ‘𝐷) ∈ 𝑈)
141, 13wununi 10594 . . . . . 6 (𝜑 ran (Hom ‘𝐷) ∈ 𝑈)
151, 11, 14wunxp 10612 . . . . 5 (𝜑 → ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ 𝑈)
161, 15wunpw 10595 . . . 4 (𝜑 → 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ 𝑈)
171, 6, 6wunxp 10612 . . . 4 (𝜑 → ((Base‘𝐶) × (Base‘𝐶)) ∈ 𝑈)
181, 16, 17wunmap 10614 . . 3 (𝜑 → (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))) ∈ 𝑈)
191, 7, 18wunxp 10612 . 2 (𝜑 → (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))) ∈ 𝑈)
20 relfunc 17766 . . . 4 Rel (𝐶 Func 𝐷)
2120a1i 11 . . 3 (𝜑 → Rel (𝐶 Func 𝐷))
22 df-br 5092 . . . 4 (𝑓(𝐶 Func 𝐷)𝑔 ↔ ⟨𝑓, 𝑔⟩ ∈ (𝐶 Func 𝐷))
23 eqid 2731 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
24 eqid 2731 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
25 simpr 484 . . . . . . . 8 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑓(𝐶 Func 𝐷)𝑔)
2623, 24, 25funcf1 17770 . . . . . . 7 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑓:(Base‘𝐶)⟶(Base‘𝐷))
27 fvex 6835 . . . . . . . 8 (Base‘𝐷) ∈ V
28 fvex 6835 . . . . . . . 8 (Base‘𝐶) ∈ V
2927, 28elmap 8795 . . . . . . 7 (𝑓 ∈ ((Base‘𝐷) ↑m (Base‘𝐶)) ↔ 𝑓:(Base‘𝐶)⟶(Base‘𝐷))
3026, 29sylibr 234 . . . . . 6 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑓 ∈ ((Base‘𝐷) ↑m (Base‘𝐶)))
31 mapsspw 8802 . . . . . . . . . . 11 (((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ 𝒫 (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))))
32 fvssunirn 6853 . . . . . . . . . . . . 13 ((Hom ‘𝐶)‘𝑧) ⊆ ran (Hom ‘𝐶)
33 ovssunirn 7382 . . . . . . . . . . . . 13 ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ⊆ ran (Hom ‘𝐷)
34 xpss12 5631 . . . . . . . . . . . . 13 ((((Hom ‘𝐶)‘𝑧) ⊆ ran (Hom ‘𝐶) ∧ ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ⊆ ran (Hom ‘𝐷)) → (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧)))) ⊆ ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)))
3532, 33, 34mp2an 692 . . . . . . . . . . . 12 (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧)))) ⊆ ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
3635sspwi 4562 . . . . . . . . . . 11 𝒫 (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧)))) ⊆ 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
3731, 36sstri 3944 . . . . . . . . . 10 (((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
3837rgenw 3051 . . . . . . . . 9 𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
39 ss2ixp 8834 . . . . . . . . 9 (∀𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) → X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)))
4038, 39ax-mp 5 . . . . . . . 8 X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
4128, 28xpex 7686 . . . . . . . . 9 ((Base‘𝐶) × (Base‘𝐶)) ∈ V
42 fvex 6835 . . . . . . . . . . . . 13 (Hom ‘𝐶) ∈ V
4342rnex 7840 . . . . . . . . . . . 12 ran (Hom ‘𝐶) ∈ V
4443uniex 7674 . . . . . . . . . . 11 ran (Hom ‘𝐶) ∈ V
45 fvex 6835 . . . . . . . . . . . . 13 (Hom ‘𝐷) ∈ V
4645rnex 7840 . . . . . . . . . . . 12 ran (Hom ‘𝐷) ∈ V
4746uniex 7674 . . . . . . . . . . 11 ran (Hom ‘𝐷) ∈ V
4844, 47xpex 7686 . . . . . . . . . 10 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ V
4948pwex 5318 . . . . . . . . 9 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ V
5041, 49ixpconst 8831 . . . . . . . 8 X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) = (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))
5140, 50sseqtri 3983 . . . . . . 7 X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))
52 eqid 2731 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
53 eqid 2731 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
5423, 52, 53, 25funcixp 17771 . . . . . . 7 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑔X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)))
5551, 54sselid 3932 . . . . . 6 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑔 ∈ (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))))
5630, 55opelxpd 5655 . . . . 5 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → ⟨𝑓, 𝑔⟩ ∈ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))))
5756ex 412 . . . 4 (𝜑 → (𝑓(𝐶 Func 𝐷)𝑔 → ⟨𝑓, 𝑔⟩ ∈ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))))))
5822, 57biimtrrid 243 . . 3 (𝜑 → (⟨𝑓, 𝑔⟩ ∈ (𝐶 Func 𝐷) → ⟨𝑓, 𝑔⟩ ∈ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))))))
5921, 58relssdv 5728 . 2 (𝜑 → (𝐶 Func 𝐷) ⊆ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))))
601, 19, 59wunss 10600 1 (𝜑 → (𝐶 Func 𝐷) ∈ 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2111  wral 3047  wss 3902  𝒫 cpw 4550  cop 4582   cuni 4859   class class class wbr 5091   × cxp 5614  ran crn 5617  Rel wrel 5621  wf 6477  cfv 6481  (class class class)co 7346  1st c1st 7919  2nd c2nd 7920  m cmap 8750  Xcixp 8821  WUnicwun 10588  ndxcnx 17101  Basecbs 17117  Hom chom 17169   Func cfunc 17758
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-cnex 11059  ax-resscn 11060  ax-1cn 11061  ax-icn 11062  ax-addcl 11063  ax-addrcl 11064  ax-mulcl 11065  ax-mulrcl 11066  ax-mulcom 11067  ax-addass 11068  ax-mulass 11069  ax-distr 11070  ax-i2m1 11071  ax-1ne0 11072  ax-1rid 11073  ax-rnegex 11074  ax-rrecex 11075  ax-cnre 11076  ax-pre-lttri 11077  ax-pre-lttrn 11078  ax-pre-ltadd 11079
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-er 8622  df-map 8752  df-pm 8753  df-ixp 8822  df-en 8870  df-dom 8871  df-sdom 8872  df-wun 10590  df-pnf 11145  df-mnf 11146  df-ltxr 11148  df-nn 12123  df-2 12185  df-3 12186  df-4 12187  df-5 12188  df-6 12189  df-7 12190  df-8 12191  df-9 12192  df-n0 12379  df-dec 12586  df-slot 17090  df-ndx 17102  df-base 17118  df-hom 17182  df-func 17762
This theorem is referenced by:  wunnat  17863  catcfuccl  18022
  Copyright terms: Public domain W3C validator