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 43646
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 7456 . . . 4 (𝑛 = 0 → (𝑅𝑟𝑛) = (𝑅𝑟0))
32ssiun2s 5071 . . 3 (0 ∈ 𝑁 → (𝑅𝑟0) ⊆ 𝑛𝑁 (𝑅𝑟𝑛))
41, 3syl 17 . 2 (𝜑 → (𝑅𝑟0) ⊆ 𝑛𝑁 (𝑅𝑟𝑛))
5 fvmptiunrelexplb0d.r . . 3 (𝜑𝑅 ∈ V)
6 relexp0g 15071 . . 3 (𝑅 ∈ V → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
75, 6syl 17 . 2 (𝜑 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
8 fvmptiunrelexplb0d.c . . . 4 𝐶 = (𝑟 ∈ V ↦ 𝑛𝑁 (𝑟𝑟𝑛))
9 oveq1 7455 . . . . 5 (𝑟 = 𝑅 → (𝑟𝑟𝑛) = (𝑅𝑟𝑛))
109iuneq2d 5045 . . . 4 (𝑟 = 𝑅 𝑛𝑁 (𝑟𝑟𝑛) = 𝑛𝑁 (𝑅𝑟𝑛))
11 fvmptiunrelexplb0d.n . . . . 5 (𝜑𝑁 ∈ V)
12 ovex 7481 . . . . . 6 (𝑅𝑟𝑛) ∈ V
1312rgenw 3071 . . . . 5 𝑛𝑁 (𝑅𝑟𝑛) ∈ V
14 iunexg 8004 . . . . 5 ((𝑁 ∈ V ∧ ∀𝑛𝑁 (𝑅𝑟𝑛) ∈ V) → 𝑛𝑁 (𝑅𝑟𝑛) ∈ V)
1511, 13, 14sylancl 585 . . . 4 (𝜑 𝑛𝑁 (𝑅𝑟𝑛) ∈ V)
168, 10, 5, 15fvmptd3 7052 . . 3 (𝜑 → (𝐶𝑅) = 𝑛𝑁 (𝑅𝑟𝑛))
1716eqcomd 2746 . 2 (𝜑 𝑛𝑁 (𝑅𝑟𝑛) = (𝐶𝑅))
184, 7, 173sstr3d 4055 1 (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2108  wral 3067  Vcvv 3488  cun 3974  wss 3976   ciun 5015  cmpt 5249   I cid 5592  dom cdm 5700  ran crn 5701  cres 5702  cfv 6573  (class class class)co 7448  0cc0 11184  𝑟crelexp 15068
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-mulcl 11246  ax-i2m1 11252
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-iota 6525  df-fun 6575  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-n0 12554  df-relexp 15069
This theorem is referenced by:  fvmptiunrelexplb0da  43647  fvrcllb0d  43655  fvrtrcllb0d  43697
  Copyright terms: Public domain W3C validator