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

Theorem fvmptiunrelexplb0da 44685
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
fvmptiunrelexplb0da.c 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛))
fvmptiunrelexplb0da.r (𝜑 → 𝑅 ∈ V)
fvmptiunrelexplb0da.n (𝜑 → 𝑁 ∈ V)
fvmptiunrelexplb0da.rel (𝜑 → Rel 𝑅)
fvmptiunrelexplb0da.0 (𝜑 → 0 ∈ 𝑁)
Assertion
Ref Expression
fvmptiunrelexplb0da (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (𝐶‘𝑅))
Distinct variable groups:   𝑛,𝑟,𝐶,𝑁   𝑅,𝑛,𝑟
Allowed substitution hints:   𝜑(𝑛, 𝑟)

Proof of Theorem fvmptiunrelexplb0da
StepHypRef Expression
1 fvmptiunrelexplb0da.rel . . . 4 (𝜑 → Rel 𝑅)
2 relfld 6277 . . . 4 (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅))
31, 2syl 18 . . 3 (𝜑 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅))
43reseq2d 5969 . 2 (𝜑 → ( I ↾ ∪ ∪ 𝑅) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
5 fvmptiunrelexplb0da.c . . 3 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛))
6 fvmptiunrelexplb0da.r . . 3 (𝜑 → 𝑅 ∈ V)
7 fvmptiunrelexplb0da.n . . 3 (𝜑 → 𝑁 ∈ V)
8 fvmptiunrelexplb0da.0 . . 3 (𝜑 → 0 ∈ 𝑁)
95, 6, 7, 8fvmptiunrelexplb0d 44684 . 2 (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅))
104, 9eqsstrd 3942 1 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (𝐶‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∪ cun 4149  ∪ cuni 4866  ∪ ciun 4950   ↦ cmpt 5185   I cid 5544  dom cdm 5650  ran crn 5651   ↾ cres 5652  Rel wrel 5655  ‘cfv 6538  (class class class)co 7420  0cc0 11200  ↑𝑟crelexp 15172
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-mulcl 11262  ax-i2m1 11268
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-n0 12607  df-relexp 15173
This theorem is used by:  fvrcllb0da  44694  fvrtrcllb0da  44736
  Copyright terms: Public domain W3C validator