ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  prdsvallem GIF version

Theorem prdsvallem 13681
Description: Lemma for prdsval 14281. (Contributed by Stefan O'Rear, 3-Jan-2015.) Extracted from the former proof of prdsval 14281, dependency on df-hom 13515 removed. (Revised by AV, 13-Oct-2024.)
Assertion
Ref Expression
prdsvallem (𝑓 ∈ 𝑣, 𝑔 ∈ 𝑣 ↦ X𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥))) ∈ V
Distinct variable groups:   𝑥,𝑟   𝑓,𝑔,𝑟   𝑣,𝑓,𝑔

Proof of Theorem prdsvallem
StepHypRef Expression
1 vex 2824 . 2 𝑣 ∈ V
2 fnmap 6933 . . . 4 ↑𝑚 Fn (V × V)
3 vex 2824 . . . . . . . . . 10 𝑟 ∈ V
43rnex 5052 . . . . . . . . 9 ran 𝑟 ∈ V
54uniex 4585 . . . . . . . 8 ∪ ran 𝑟 ∈ V
65rnex 5052 . . . . . . 7 ran ∪ ran 𝑟 ∈ V
76uniex 4585 . . . . . 6 ∪ ran ∪ ran 𝑟 ∈ V
87rnex 5052 . . . . 5 ran ∪ ran ∪ ran 𝑟 ∈ V
98uniex 4585 . . . 4 ∪ ran ∪ ran ∪ ran 𝑟 ∈ V
103dmex 5051 . . . 4 dom 𝑟 ∈ V
11 fnovex 6121 . . . 4 (( ↑𝑚 Fn (V × V) ∧ ∪ ran ∪ ran ∪ ran 𝑟 ∈ V ∧ dom 𝑟 ∈ V) → (∪ ran ∪ ran ∪ ran 𝑟 ↑𝑚 dom 𝑟) ∈ V)
122, 9, 10, 11mp3an 1378 . . 3 (∪ ran ∪ ran ∪ ran 𝑟 ↑𝑚 dom 𝑟) ∈ V
1312pwex 4322 . 2 𝒫 (∪ ran ∪ ran ∪ ran 𝑟 ↑𝑚 dom 𝑟) ∈ V
14 vex 2824 . . . . . . . . . 10 𝑓 ∈ V
15 vex 2824 . . . . . . . . . 10 𝑥 ∈ V
1614, 15fvex 5718 . . . . . . . . 9 (𝑓‘𝑥) ∈ V
17 vex 2824 . . . . . . . . . 10 𝑔 ∈ V
1817, 15fvex 5718 . . . . . . . . 9 (𝑔‘𝑥) ∈ V
19 ovssunirng 6123 . . . . . . . . 9 (((𝑓‘𝑥) ∈ V ∧ (𝑔‘𝑥) ∈ V) → ((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran (Hom ‘(𝑟‘𝑥)))
2016, 18, 19mp2an 430 . . . . . . . 8 ((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran (Hom ‘(𝑟‘𝑥))
21 homid 13648 . . . . . . . . . . . 12 Hom = Slot (Hom ‘ndx)
223, 15fvex 5718 . . . . . . . . . . . . 13 (𝑟‘𝑥) ∈ V
2322a1i 9 . . . . . . . . . . . 12 (⊤ → (𝑟‘𝑥) ∈ V)
24 homslid 13649 . . . . . . . . . . . . . 14 (Hom = Slot (Hom ‘ndx) ∧ (Hom ‘ndx) ∈ ℕ)
2524simpri 113 . . . . . . . . . . . . 13 (Hom ‘ndx) ∈ ℕ
2625a1i 9 . . . . . . . . . . . 12 (⊤ → (Hom ‘ndx) ∈ ℕ)
2721, 23, 26strfvssn 13433 . . . . . . . . . . 11 (⊤ → (Hom ‘(𝑟‘𝑥)) ⊆ ∪ ran (𝑟‘𝑥))
2827mptru 1411 . . . . . . . . . 10 (Hom ‘(𝑟‘𝑥)) ⊆ ∪ ran (𝑟‘𝑥)
29 fvssunirng 5713 . . . . . . . . . . . 12 (𝑥 ∈ V → (𝑟‘𝑥) ⊆ ∪ ran 𝑟)
3029elv 2825 . . . . . . . . . . 11 (𝑟‘𝑥) ⊆ ∪ ran 𝑟
31 rnss 5014 . . . . . . . . . . 11 ((𝑟‘𝑥) ⊆ ∪ ran 𝑟 → ran (𝑟‘𝑥) ⊆ ran ∪ ran 𝑟)
32 uniss 3956 . . . . . . . . . . 11 (ran (𝑟‘𝑥) ⊆ ran ∪ ran 𝑟 → ∪ ran (𝑟‘𝑥) ⊆ ∪ ran ∪ ran 𝑟)
3330, 31, 32mp2b 8 . . . . . . . . . 10 ∪ ran (𝑟‘𝑥) ⊆ ∪ ran ∪ ran 𝑟
3428, 33sstri 3257 . . . . . . . . 9 (Hom ‘(𝑟‘𝑥)) ⊆ ∪ ran ∪ ran 𝑟
35 rnss 5014 . . . . . . . . 9 ((Hom ‘(𝑟‘𝑥)) ⊆ ∪ ran ∪ ran 𝑟 → ran (Hom ‘(𝑟‘𝑥)) ⊆ ran ∪ ran ∪ ran 𝑟)
36 uniss 3956 . . . . . . . . 9 (ran (Hom ‘(𝑟‘𝑥)) ⊆ ran ∪ ran ∪ ran 𝑟 → ∪ ran (Hom ‘(𝑟‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑟)
3734, 35, 36mp2b 8 . . . . . . . 8 ∪ ran (Hom ‘(𝑟‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑟
3820, 37sstri 3257 . . . . . . 7 ((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑟
3938rgenw 2605 . . . . . 6 ∀𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑟
40 ss2ixp 6998 . . . . . 6 (∀𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ ∪ ran ∪ ran ∪ ran 𝑟 → X𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ X𝑥 ∈ dom 𝑟∪ ran ∪ ran ∪ ran 𝑟)
4139, 40ax-mp 5 . . . . 5 X𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ X𝑥 ∈ dom 𝑟∪ ran ∪ ran ∪ ran 𝑟
4210, 9ixpconst 6995 . . . . 5 X𝑥 ∈ dom 𝑟∪ ran ∪ ran ∪ ran 𝑟 = (∪ ran ∪ ran ∪ ran 𝑟 ↑𝑚 dom 𝑟)
4341, 42sseqtri 3282 . . . 4 X𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ⊆ (∪ ran ∪ ran ∪ ran 𝑟 ↑𝑚 dom 𝑟)
4412, 43elpwi2 4296 . . 3 X𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 (∪ ran ∪ ran ∪ ran 𝑟 ↑𝑚 dom 𝑟)
4544rgen2w 2606 . 2 ∀𝑓 ∈ 𝑣 ∀𝑔 ∈ 𝑣 X𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥)) ∈ 𝒫 (∪ ran ∪ ran ∪ ran 𝑟 ↑𝑚 dom 𝑟)
461, 1, 13, 45mpoexw 6453 1 (𝑓 ∈ 𝑣, 𝑔 ∈ 𝑣 ↦ X𝑥 ∈ dom 𝑟((𝑓‘𝑥)(Hom ‘(𝑟‘𝑥))(𝑔‘𝑥))) ∈ V
Colors of variables:    wff set class
This proof depends on syntax axioms:   = wceq 1402  ⊤wtru 1403   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220  𝒫 cpw 3688  ∪ cuni 3935   × cxp 4774  dom cdm 4776  ran crn 4777   Fn wfn 5375  ‘cfv 5380  (class class class)co 6088   ∈ cmpo 6090   ↑𝑚 cmap 6926  Xcixp 6985  ℕcn 9314  ndxcnx 13408  Slot cslot 13410  Hom chom 13502
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-cnre 8297
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-map 6928  df-ixp 6986  df-sub 8507  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-5 9376  df-6 9377  df-7 9378  df-8 9379  df-9 9380  df-n0 9576  df-dec 9790  df-ndx 13414  df-slot 13415  df-hom 13515
This theorem is used by:  prdsval  14281
  Copyright terms: Public domain W3C validator