Theorem relexp0g 14975

Description: A relation composed zero times is the (restricted) identity. (Contributed by RP, 22-May-2020.)

Assertion

Ref	Expression
relexp0g	⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))

Proof of Theorem relexp0g

Dummy variables 𝑛 𝑟 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2740	. . 3 ⊢ (𝑅 ∈ 𝑉 → (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))))
2		simprr 778	. . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 0)) → 𝑛 = 0)
3	2	iftrued 4462	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 0)) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = ( I ↾ (dom 𝑟 ∪ ran 𝑟)))
4		dmeq 5845	. . . . . . 7 ⊢ (𝑟 = 𝑅 → dom 𝑟 = dom 𝑅)
5		rneq 5878	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ran 𝑟 = ran 𝑅)
6	4, 5	uneq12d 4099	. . . . . 6 ⊢ (𝑟 = 𝑅 → (dom 𝑟 ∪ ran 𝑟) = (dom 𝑅 ∪ ran 𝑅))
7	6	reseq2d 5931	. . . . 5 ⊢ (𝑟 = 𝑅 → ( I ↾ (dom 𝑟 ∪ ran 𝑟)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
8	7	ad2antrl 734	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 0)) → ( I ↾ (dom 𝑟 ∪ ran 𝑟)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
9	3, 8	eqtrd 2774	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 0)) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
10		elex 3452	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
11		0nn0 12443	. . . 4 ⊢ 0 ∈ ℕ0
12	11	a1i 11	. . 3 ⊢ (𝑅 ∈ 𝑉 → 0 ∈ ℕ0)
13		dmexg 7841	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → dom 𝑅 ∈ V)
14		rnexg 7842	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → ran 𝑅 ∈ V)
15		unexg 7686	. . . . 5 ⊢ ((dom 𝑅 ∈ V ∧ ran 𝑅 ∈ V) → (dom 𝑅 ∪ ran 𝑅) ∈ V)
16	13, 14, 15	syl2anc 590	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (dom 𝑅 ∪ ran 𝑅) ∈ V)
17		resiexg 7852	. . . 4 ⊢ ((dom 𝑅 ∪ ran 𝑅) ∈ V → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V)
18	16, 17	syl 17	. . 3 ⊢ (𝑅 ∈ 𝑉 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V)
19	1, 9, 10, 12, 18	ovmpod 7508	. 2 ⊢ (𝑅 ∈ 𝑉 → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
20		df-relexp 14973	. . 3 ⊢ ↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))
21		oveq 7362	. . . . 5 ⊢ (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → (𝑅↑𝑟0) = (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))0))
22	21	eqeq1d 2741	. . . 4 ⊢ (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → ((𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ↔ (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))))
23	22	imbi2d 341	. . 3 ⊢ (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → ((𝑅 ∈ 𝑉 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) ↔ (𝑅 ∈ 𝑉 → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))))
24	20, 23	ax-mp 5	. 2 ⊢ ((𝑅 ∈ 𝑉 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) ↔ (𝑅 ∈ 𝑉 → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))))
25	19, 24	mpbir 232	1 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119  Vcvv 3431   ∪ cun 3881  ifcif 4454   ↦ cmpt 5153   I cid 5512  dom cdm 5618  ran crn 5619   ↾ cres 5620   ∘ ccom 5622  ‘cfv 6485  (class class class)co 7356   ∈ cmpo 7358  0cc0 11029  1c1 11030  ℕ₀cn0 12428  seqcseq 13954  ↑_𝑟crelexp 14972

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-mulcl 11091  ax-i2m1 11097

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-iota 6441  df-fun 6487  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-n0 12429  df-relexp 14973

This theorem is referenced by:  relexp0  14976  relexpcnv  14988  relexp0rel  14990  relexpdmg  14995  relexprng  14999  relexpfld  15002  relexpaddg  15006  dfrcl3  44119  fvmptiunrelexplb0d  44128  brfvrcld2  44136  relexp0eq  44145  iunrelexp0  44146  relexpiidm  44148  relexpss1d  44149  relexpmulg  44154  iunrelexpmin2  44156  relexp01min  44157  relexp0a  44160  relexpxpmin  44161  relexpaddss  44162  dfrtrcl3  44177  cotrclrcl  44186