Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fvmptiunrelexplb0d Structured version   Visualization version   GIF version

Theorem fvmptiunrelexplb0d 44874
Description: If the indexed union ranges over the zeroth power of the relation, then a restriction of the identity relation is a subset of the appliction of the function to the relation. (Contributed by RP, 22-Jul-2020.)
Hypotheses
Ref Expression
fvmptiunrelexplb0d.c 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛))
fvmptiunrelexplb0d.r (𝜑 → 𝑅 ∈ V)
fvmptiunrelexplb0d.n (𝜑 → 𝑁 ∈ V)
fvmptiunrelexplb0d.0 (𝜑 → 0 ∈ 𝑁)
Assertion
Ref Expression
fvmptiunrelexplb0d (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅))
Distinct variable groups:   𝑛,𝑟,𝑁   𝑅,𝑛,𝑟
Allowed substitution hints:   𝜑(𝑛, 𝑟)   𝐶(𝑛, 𝑟)

Proof of Theorem fvmptiunrelexplb0d
StepHypRef Expression
1 fvmptiunrelexplb0d.0 . . 3 (𝜑 → 0 ∈ 𝑁)
2 oveq2 7448 . . . 4 (𝑛 = 0 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟0))
32ssiun2s 5010 . . 3 (0 ∈ 𝑁 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
41, 3syl 18 . 2 (𝜑 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
5 fvmptiunrelexplb0d.r . . 3 (𝜑 → 𝑅 ∈ V)
6 relexp0g 15201 . . 3 (𝑅 ∈ V → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
75, 6syl 18 . 2 (𝜑 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
8 fvmptiunrelexplb0d.c . . . 4 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛))
9 oveq1 7447 . . . . 5 (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛))
109iuneq2d 4984 . . . 4 (𝑟 = 𝑅 → ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
11 fvmptiunrelexplb0d.n . . . . 5 (𝜑 → 𝑁 ∈ V)
12 ovex 7473 . . . . . 6 (𝑅↑𝑟𝑛) ∈ V
1312rgenw 3084 . . . . 5 ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V
14 iunexg 7996 . . . . 5 ((𝑁 ∈ V ∧ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V)
1511, 13, 14sylancl 598 . . . 4 (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V)
168, 10, 5, 15fvmptd3 7037 . . 3 (𝜑 → (𝐶‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
1716eqcomd 2769 . 2 (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) = (𝐶‘𝑅))
184, 7, 173sstr3d 3967 1 (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ∪ ciun 4954   ↦ cmpt 5189   I cid 5549  dom cdm 5655  ran crn 5656   ↾ cres 5657  ‘cfv 6555  (class class class)co 7440  0cc0 11224  ↑𝑟crelexp 15198
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 7772  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-mulcl 11286  ax-i2m1 11292
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-rab 3417  df-v 3456  df-sbc 3743  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-iota 6509  df-fun 6557  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-n0 12631  df-relexp 15199
This theorem is used by:  fvmptiunrelexplb0da  44875  fvrcllb0d  44883  fvrtrcllb0d  44925
  Copyright terms: Public domain W3C validator