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

Theorem wunfunc 17684
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 16985 . . . . 5 Base = Slot (Base‘ndx)
3 wunfunc.3 . . . . 5 (𝜑𝐷𝑈)
42, 1, 3wunstr 16959 . . . 4 (𝜑 → (Base‘𝐷) ∈ 𝑈)
5 wunfunc.2 . . . . 5 (𝜑𝐶𝑈)
62, 1, 5wunstr 16959 . . . 4 (𝜑 → (Base‘𝐶) ∈ 𝑈)
71, 4, 6wunmap 10555 . . 3 (𝜑 → ((Base‘𝐷) ↑m (Base‘𝐶)) ∈ 𝑈)
8 homid 17192 . . . . . . . . 9 Hom = Slot (Hom ‘ndx)
98, 1, 5wunstr 16959 . . . . . . . 8 (𝜑 → (Hom ‘𝐶) ∈ 𝑈)
101, 9wunrn 10558 . . . . . . 7 (𝜑 → ran (Hom ‘𝐶) ∈ 𝑈)
111, 10wununi 10535 . . . . . 6 (𝜑 ran (Hom ‘𝐶) ∈ 𝑈)
128, 1, 3wunstr 16959 . . . . . . . 8 (𝜑 → (Hom ‘𝐷) ∈ 𝑈)
131, 12wunrn 10558 . . . . . . 7 (𝜑 → ran (Hom ‘𝐷) ∈ 𝑈)
141, 13wununi 10535 . . . . . 6 (𝜑 ran (Hom ‘𝐷) ∈ 𝑈)
151, 11, 14wunxp 10553 . . . . 5 (𝜑 → ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ 𝑈)
161, 15wunpw 10536 . . . 4 (𝜑 → 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ 𝑈)
171, 6, 6wunxp 10553 . . . 4 (𝜑 → ((Base‘𝐶) × (Base‘𝐶)) ∈ 𝑈)
181, 16, 17wunmap 10555 . . 3 (𝜑 → (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))) ∈ 𝑈)
191, 7, 18wunxp 10553 . 2 (𝜑 → (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))) ∈ 𝑈)
20 relfunc 17647 . . . 4 Rel (𝐶 Func 𝐷)
2120a1i 11 . . 3 (𝜑 → Rel (𝐶 Func 𝐷))
22 df-br 5088 . . . 4 (𝑓(𝐶 Func 𝐷)𝑔 ↔ ⟨𝑓, 𝑔⟩ ∈ (𝐶 Func 𝐷))
23 eqid 2737 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
24 eqid 2737 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
25 simpr 485 . . . . . . . 8 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑓(𝐶 Func 𝐷)𝑔)
2623, 24, 25funcf1 17651 . . . . . . 7 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑓:(Base‘𝐶)⟶(Base‘𝐷))
27 fvex 6824 . . . . . . . 8 (Base‘𝐷) ∈ V
28 fvex 6824 . . . . . . . 8 (Base‘𝐶) ∈ V
2927, 28elmap 8707 . . . . . . 7 (𝑓 ∈ ((Base‘𝐷) ↑m (Base‘𝐶)) ↔ 𝑓:(Base‘𝐶)⟶(Base‘𝐷))
3026, 29sylibr 233 . . . . . 6 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑓 ∈ ((Base‘𝐷) ↑m (Base‘𝐶)))
31 mapsspw 8714 . . . . . . . . . . 11 (((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ 𝒫 (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))))
32 fvssunirn 6842 . . . . . . . . . . . . 13 ((Hom ‘𝐶)‘𝑧) ⊆ ran (Hom ‘𝐶)
33 ovssunirn 7351 . . . . . . . . . . . . 13 ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ⊆ ran (Hom ‘𝐷)
34 xpss12 5622 . . . . . . . . . . . . 13 ((((Hom ‘𝐶)‘𝑧) ⊆ ran (Hom ‘𝐶) ∧ ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ⊆ ran (Hom ‘𝐷)) → (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧)))) ⊆ ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)))
3532, 33, 34mp2an 689 . . . . . . . . . . . 12 (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧)))) ⊆ ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
3635sspwi 4557 . . . . . . . . . . 11 𝒫 (((Hom ‘𝐶)‘𝑧) × ((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧)))) ⊆ 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
3731, 36sstri 3940 . . . . . . . . . 10 (((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
3837rgenw 3066 . . . . . . . . 9 𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷))
39 ss2ixp 8746 . . . . . . . . 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 7643 . . . . . . . . 9 ((Base‘𝐶) × (Base‘𝐶)) ∈ V
42 fvex 6824 . . . . . . . . . . . . 13 (Hom ‘𝐶) ∈ V
4342rnex 7804 . . . . . . . . . . . 12 ran (Hom ‘𝐶) ∈ V
4443uniex 7634 . . . . . . . . . . 11 ran (Hom ‘𝐶) ∈ V
45 fvex 6824 . . . . . . . . . . . . 13 (Hom ‘𝐷) ∈ V
4645rnex 7804 . . . . . . . . . . . 12 ran (Hom ‘𝐷) ∈ V
4746uniex 7634 . . . . . . . . . . 11 ran (Hom ‘𝐷) ∈ V
4844, 47xpex 7643 . . . . . . . . . 10 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ V
4948pwex 5318 . . . . . . . . 9 𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ∈ V
5041, 49ixpconst 8743 . . . . . . . 8 X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) = (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))
5140, 50sseqtri 3967 . . . . . . 7 X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)) ⊆ (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))
52 eqid 2737 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
53 eqid 2737 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
5423, 52, 53, 25funcixp 17652 . . . . . . 7 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑔X𝑧 ∈ ((Base‘𝐶) × (Base‘𝐶))(((𝑓‘(1st𝑧))(Hom ‘𝐷)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘𝐶)‘𝑧)))
5551, 54sselid 3929 . . . . . 6 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → 𝑔 ∈ (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))))
5630, 55opelxpd 5645 . . . . 5 ((𝜑𝑓(𝐶 Func 𝐷)𝑔) → ⟨𝑓, 𝑔⟩ ∈ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))))
5756ex 413 . . . 4 (𝜑 → (𝑓(𝐶 Func 𝐷)𝑔 → ⟨𝑓, 𝑔⟩ ∈ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))))))
5822, 57syl5bir 242 . . 3 (𝜑 → (⟨𝑓, 𝑔⟩ ∈ (𝐶 Func 𝐷) → ⟨𝑓, 𝑔⟩ ∈ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶))))))
5921, 58relssdv 5717 . 2 (𝜑 → (𝐶 Func 𝐷) ⊆ (((Base‘𝐷) ↑m (Base‘𝐶)) × (𝒫 ( ran (Hom ‘𝐶) × ran (Hom ‘𝐷)) ↑m ((Base‘𝐶) × (Base‘𝐶)))))
601, 19, 59wunss 10541 1 (𝜑 → (𝐶 Func 𝐷) ∈ 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wcel 2105  wral 3062  wss 3897  𝒫 cpw 4545  cop 4577   cuni 4850   class class class wbr 5087   × cxp 5605  ran crn 5608  Rel wrel 5612  wf 6461  cfv 6465  (class class class)co 7315  1st c1st 7874  2nd c2nd 7875  m cmap 8663  Xcixp 8733  WUnicwun 10529  ndxcnx 16964  Basecbs 16982  Hom chom 17043   Func cfunc 17639
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2708  ax-rep 5224  ax-sep 5238  ax-nul 5245  ax-pow 5303  ax-pr 5367  ax-un 7628  ax-cnex 11000  ax-resscn 11001  ax-1cn 11002  ax-icn 11003  ax-addcl 11004  ax-addrcl 11005  ax-mulcl 11006  ax-mulrcl 11007  ax-mulcom 11008  ax-addass 11009  ax-mulass 11010  ax-distr 11011  ax-i2m1 11012  ax-1ne0 11013  ax-1rid 11014  ax-rnegex 11015  ax-rrecex 11016  ax-cnre 11017  ax-pre-lttri 11018  ax-pre-lttrn 11019  ax-pre-ltadd 11020
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-reu 3351  df-rab 3405  df-v 3443  df-sbc 3727  df-csb 3843  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3916  df-nul 4268  df-if 4472  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4851  df-iun 4939  df-br 5088  df-opab 5150  df-mpt 5171  df-tr 5205  df-id 5507  df-eprel 5513  df-po 5521  df-so 5522  df-fr 5562  df-we 5564  df-xp 5613  df-rel 5614  df-cnv 5615  df-co 5616  df-dm 5617  df-rn 5618  df-res 5619  df-ima 5620  df-pred 6224  df-ord 6291  df-on 6292  df-lim 6293  df-suc 6294  df-iota 6417  df-fun 6467  df-fn 6468  df-f 6469  df-f1 6470  df-fo 6471  df-f1o 6472  df-fv 6473  df-ov 7318  df-oprab 7319  df-mpo 7320  df-om 7758  df-1st 7876  df-2nd 7877  df-frecs 8144  df-wrecs 8175  df-recs 8249  df-rdg 8288  df-er 8546  df-map 8665  df-pm 8666  df-ixp 8734  df-en 8782  df-dom 8783  df-sdom 8784  df-wun 10531  df-pnf 11084  df-mnf 11085  df-ltxr 11087  df-nn 12047  df-2 12109  df-3 12110  df-4 12111  df-5 12112  df-6 12113  df-7 12114  df-8 12115  df-9 12116  df-n0 12307  df-dec 12511  df-slot 16953  df-ndx 16965  df-base 16983  df-hom 17056  df-func 17643
This theorem is referenced by:  wunnat  17742  wunnatOLD  17743  catcfuccl  17904  catcfucclOLD  17905
  Copyright terms: Public domain W3C validator