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 43666
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 7377 . . . 4 (𝑛 = 0 → (𝑅𝑟𝑛) = (𝑅𝑟0))
32ssiun2s 5007 . . 3 (0 ∈ 𝑁 → (𝑅𝑟0) ⊆ 𝑛𝑁 (𝑅𝑟𝑛))
41, 3syl 17 . 2 (𝜑 → (𝑅𝑟0) ⊆ 𝑛𝑁 (𝑅𝑟𝑛))
5 fvmptiunrelexplb0d.r . . 3 (𝜑𝑅 ∈ V)
6 relexp0g 14964 . . 3 (𝑅 ∈ V → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
75, 6syl 17 . 2 (𝜑 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
8 fvmptiunrelexplb0d.c . . . 4 𝐶 = (𝑟 ∈ V ↦ 𝑛𝑁 (𝑟𝑟𝑛))
9 oveq1 7376 . . . . 5 (𝑟 = 𝑅 → (𝑟𝑟𝑛) = (𝑅𝑟𝑛))
109iuneq2d 4982 . . . 4 (𝑟 = 𝑅 𝑛𝑁 (𝑟𝑟𝑛) = 𝑛𝑁 (𝑅𝑟𝑛))
11 fvmptiunrelexplb0d.n . . . . 5 (𝜑𝑁 ∈ V)
12 ovex 7402 . . . . . 6 (𝑅𝑟𝑛) ∈ V
1312rgenw 3048 . . . . 5 𝑛𝑁 (𝑅𝑟𝑛) ∈ V
14 iunexg 7921 . . . . 5 ((𝑁 ∈ V ∧ ∀𝑛𝑁 (𝑅𝑟𝑛) ∈ V) → 𝑛𝑁 (𝑅𝑟𝑛) ∈ V)
1511, 13, 14sylancl 586 . . . 4 (𝜑 𝑛𝑁 (𝑅𝑟𝑛) ∈ V)
168, 10, 5, 15fvmptd3 6973 . . 3 (𝜑 → (𝐶𝑅) = 𝑛𝑁 (𝑅𝑟𝑛))
1716eqcomd 2735 . 2 (𝜑 𝑛𝑁 (𝑅𝑟𝑛) = (𝐶𝑅))
184, 7, 173sstr3d 3998 1 (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  wral 3044  Vcvv 3444  cun 3909  wss 3911   ciun 4951  cmpt 5183   I cid 5525  dom cdm 5631  ran crn 5632  cres 5633  cfv 6499  (class class class)co 7369  0cc0 11044  𝑟crelexp 14961
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-mulcl 11106  ax-i2m1 11112
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-iota 6452  df-fun 6501  df-fv 6507  df-ov 7372  df-oprab 7373  df-mpo 7374  df-n0 12419  df-relexp 14962
This theorem is referenced by:  fvmptiunrelexplb0da  43667  fvrcllb0d  43675  fvrtrcllb0d  43717
  Copyright terms: Public domain W3C validator