Theorem fvmptiunrelexplb0d 44511

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

Step	Hyp	Ref	Expression
1		fvmptiunrelexplb0d.0	. . 3 ⊢ (𝜑 → 0 ∈ 𝑁)
2		oveq2 7424	. . . 4 ⊢ (𝑛 = 0 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟0))
3	2	ssiun2s 5011	. . 3 ⊢ (0 ∈ 𝑁 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
4	1, 3	syl 18	. 2 ⊢ (𝜑 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
5		fvmptiunrelexplb0d.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
6		relexp0g 15097	. . 3 ⊢ (𝑅 ∈ V → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
7	5, 6	syl 18	. 2 ⊢ (𝜑 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
8		fvmptiunrelexplb0d.c	. . . 4 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛))
9		oveq1 7423	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛))
10	9	iuneq2d 4985	. . . 4 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
11		fvmptiunrelexplb0d.n	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ V)
12		ovex 7449	. . . . . 6 ⊢ (𝑅↑𝑟𝑛) ∈ V
13	12	rgenw 3082	. . . . 5 ⊢ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V
14		iunexg 7963	. . . . 5 ⊢ ((𝑁 ∈ V ∧ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V)
15	11, 13, 14	sylancl 598	. . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V)
16	8, 10, 5, 15	fvmptd3 7014	. . 3 ⊢ (𝜑 → (𝐶‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛))
17	16	eqcomd 2768	. 2 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) = (𝐶‘𝑅))
18	4, 7, 17	3sstr3d 3988	1 ⊢ (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∀wral 3078  Vcvv 3453   ∪ cun 3900   ⊆ wss 3902  ∪ ciun 4954   ↦ cmpt 5190   I cid 5553  dom cdm 5659  ran crn 5660   ↾ cres 5661  ‘cfv 6537  (class class class)co 7416  0cc0 11127  ↑_𝑟crelexp 15094

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-mulcl 11189  ax-i2m1 11195

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-n0 12532  df-relexp 15095

This theorem is used by:  fvmptiunrelexplb0da  44512  fvrcllb0d  44520  fvrtrcllb0d  44562