Theorem relexpcnv 15188

Description: Commutation of converse and relation exponentiation. (Contributed by RP, 23-May-2020.)

Assertion

Ref	Expression
relexpcnv	⊢ ((𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁))

Proof of Theorem relexpcnv

Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn0 12608	. . 3 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2		oveq2 7428	. . . . . . . 8 ⊢ (𝑛 = 1 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟1))
3	2	cnveqd 5853	. . . . . . 7 ⊢ (𝑛 = 1 → ◡(𝑅↑𝑟𝑛) = ◡(𝑅↑𝑟1))
4		oveq2 7428	. . . . . . 7 ⊢ (𝑛 = 1 → (◡𝑅↑𝑟𝑛) = (◡𝑅↑𝑟1))
5	3, 4	eqeq12d 2777	. . . . . 6 ⊢ (𝑛 = 1 → (◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛) ↔ ◡(𝑅↑𝑟1) = (◡𝑅↑𝑟1)))
6	5	imbi2d 343	. . . . 5 ⊢ (𝑛 = 1 → ((𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) ↔ (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟1) = (◡𝑅↑𝑟1))))
7		oveq2 7428	. . . . . . . 8 ⊢ (𝑛 = 𝑚 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟𝑚))
8	7	cnveqd 5853	. . . . . . 7 ⊢ (𝑛 = 𝑚 → ◡(𝑅↑𝑟𝑛) = ◡(𝑅↑𝑟𝑚))
9		oveq2 7428	. . . . . . 7 ⊢ (𝑛 = 𝑚 → (◡𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑚))
10	8, 9	eqeq12d 2777	. . . . . 6 ⊢ (𝑛 = 𝑚 → (◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛) ↔ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)))
11	10	imbi2d 343	. . . . 5 ⊢ (𝑛 = 𝑚 → ((𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) ↔ (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚))))
12		oveq2 7428	. . . . . . . 8 ⊢ (𝑛 = (𝑚 + 1) → (𝑅↑𝑟𝑛) = (𝑅↑𝑟(𝑚 + 1)))
13	12	cnveqd 5853	. . . . . . 7 ⊢ (𝑛 = (𝑚 + 1) → ◡(𝑅↑𝑟𝑛) = ◡(𝑅↑𝑟(𝑚 + 1)))
14		oveq2 7428	. . . . . . 7 ⊢ (𝑛 = (𝑚 + 1) → (◡𝑅↑𝑟𝑛) = (◡𝑅↑𝑟(𝑚 + 1)))
15	13, 14	eqeq12d 2777	. . . . . 6 ⊢ (𝑛 = (𝑚 + 1) → (◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛) ↔ ◡(𝑅↑𝑟(𝑚 + 1)) = (◡𝑅↑𝑟(𝑚 + 1))))
16	15	imbi2d 343	. . . . 5 ⊢ (𝑛 = (𝑚 + 1) → ((𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) ↔ (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟(𝑚 + 1)) = (◡𝑅↑𝑟(𝑚 + 1)))))
17		oveq2 7428	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟𝑁))
18	17	cnveqd 5853	. . . . . . 7 ⊢ (𝑛 = 𝑁 → ◡(𝑅↑𝑟𝑛) = ◡(𝑅↑𝑟𝑁))
19		oveq2 7428	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (◡𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑁))
20	18, 19	eqeq12d 2777	. . . . . 6 ⊢ (𝑛 = 𝑁 → (◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛) ↔ ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁)))
21	20	imbi2d 343	. . . . 5 ⊢ (𝑛 = 𝑁 → ((𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑛) = (◡𝑅↑𝑟𝑛)) ↔ (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁))))
22		relexp1g 15179	. . . . . . 7 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅)
23	22	cnveqd 5853	. . . . . 6 ⊢ (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟1) = ◡𝑅)
24		cnvexg 7936	. . . . . . 7 ⊢ (𝑅 ∈ 𝑉 → ◡𝑅 ∈ V)
25		relexp1g 15179	. . . . . . 7 ⊢ (◡𝑅 ∈ V → (◡𝑅↑𝑟1) = ◡𝑅)
26	24, 25	syl 18	. . . . . 6 ⊢ (𝑅 ∈ 𝑉 → (◡𝑅↑𝑟1) = ◡𝑅)
27	23, 26	eqtr4d 2799	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟1) = (◡𝑅↑𝑟1))
28		cnvco 5867	. . . . . . . . 9 ⊢ ◡((𝑅↑𝑟𝑚) ∘ 𝑅) = (◡𝑅 ∘ ◡(𝑅↑𝑟𝑚))
29		simp3 1156	. . . . . . . . . 10 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚))
30	29	coeq2d 5840	. . . . . . . . 9 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → (◡𝑅 ∘ ◡(𝑅↑𝑟𝑚)) = (◡𝑅 ∘ (◡𝑅↑𝑟𝑚)))
31	28, 30	eqtrid 2808	. . . . . . . 8 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → ◡((𝑅↑𝑟𝑚) ∘ 𝑅) = (◡𝑅 ∘ (◡𝑅↑𝑟𝑚)))
32		simp2 1155	. . . . . . . . . 10 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → 𝑅 ∈ 𝑉)
33		simp1 1154	. . . . . . . . . 10 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → 𝑚 ∈ ℕ)
34		relexpsucnnr 15178	. . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑚 ∈ ℕ) → (𝑅↑𝑟(𝑚 + 1)) = ((𝑅↑𝑟𝑚) ∘ 𝑅))
35	32, 33, 34	syl2anc 596	. . . . . . . . 9 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → (𝑅↑𝑟(𝑚 + 1)) = ((𝑅↑𝑟𝑚) ∘ 𝑅))
36	35	cnveqd 5853	. . . . . . . 8 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → ◡(𝑅↑𝑟(𝑚 + 1)) = ◡((𝑅↑𝑟𝑚) ∘ 𝑅))
37	32, 24	syl 18	. . . . . . . . 9 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → ◡𝑅 ∈ V)
38		relexpsucnnl 15183	. . . . . . . . 9 ⊢ ((◡𝑅 ∈ V ∧ 𝑚 ∈ ℕ) → (◡𝑅↑𝑟(𝑚 + 1)) = (◡𝑅 ∘ (◡𝑅↑𝑟𝑚)))
39	37, 33, 38	syl2anc 596	. . . . . . . 8 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → (◡𝑅↑𝑟(𝑚 + 1)) = (◡𝑅 ∘ (◡𝑅↑𝑟𝑚)))
40	31, 36, 39	3eqtr4d 2806	. . . . . . 7 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉 ∧ ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → ◡(𝑅↑𝑟(𝑚 + 1)) = (◡𝑅↑𝑟(𝑚 + 1)))
41	40	3exp 1137	. . . . . 6 ⊢ (𝑚 ∈ ℕ → (𝑅 ∈ 𝑉 → (◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚) → ◡(𝑅↑𝑟(𝑚 + 1)) = (◡𝑅↑𝑟(𝑚 + 1)))))
42	41	a2d 30	. . . . 5 ⊢ (𝑚 ∈ ℕ → ((𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑚) = (◡𝑅↑𝑟𝑚)) → (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟(𝑚 + 1)) = (◡𝑅↑𝑟(𝑚 + 1)))))
43	6, 11, 16, 21, 27, 42	nnind 12353	. . . 4 ⊢ (𝑁 ∈ ℕ → (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁)))
44		cnvresid 6619	. . . . . . 7 ⊢ ◡( I ↾ (dom 𝑅 ∪ ran 𝑅)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))
45		uncom 4105	. . . . . . . . 9 ⊢ (dom 𝑅 ∪ ran 𝑅) = (ran 𝑅 ∪ dom 𝑅)
46		df-rn 5662	. . . . . . . . . 10 ⊢ ran 𝑅 = dom ◡𝑅
47		dfdm4 5877	. . . . . . . . . 10 ⊢ dom 𝑅 = ran ◡𝑅
48	46, 47	uneq12i 4113	. . . . . . . . 9 ⊢ (ran 𝑅 ∪ dom 𝑅) = (dom ◡𝑅 ∪ ran ◡𝑅)
49	45, 48	eqtri 2784	. . . . . . . 8 ⊢ (dom 𝑅 ∪ ran 𝑅) = (dom ◡𝑅 ∪ ran ◡𝑅)
50	49	reseq2i 5967	. . . . . . 7 ⊢ ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = ( I ↾ (dom ◡𝑅 ∪ ran ◡𝑅))
51	44, 50	eqtri 2784	. . . . . 6 ⊢ ◡( I ↾ (dom 𝑅 ∪ ran 𝑅)) = ( I ↾ (dom ◡𝑅 ∪ ran ◡𝑅))
52		oveq2 7428	. . . . . . . 8 ⊢ (𝑁 = 0 → (𝑅↑𝑟𝑁) = (𝑅↑𝑟0))
53		relexp0g 15175	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
54	52, 53	sylan9eq 2816	. . . . . . 7 ⊢ ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
55	54	cnveqd 5853	. . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ◡(𝑅↑𝑟𝑁) = ◡( I ↾ (dom 𝑅 ∪ ran 𝑅)))
56		oveq2 7428	. . . . . . . 8 ⊢ (𝑁 = 0 → (◡𝑅↑𝑟𝑁) = (◡𝑅↑𝑟0))
57	56	adantr 486	. . . . . . 7 ⊢ ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (◡𝑅↑𝑟𝑁) = (◡𝑅↑𝑟0))
58		simpr 490	. . . . . . . 8 ⊢ ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉)
59		relexp0g 15175	. . . . . . . 8 ⊢ (◡𝑅 ∈ V → (◡𝑅↑𝑟0) = ( I ↾ (dom ◡𝑅 ∪ ran ◡𝑅)))
60	58, 24, 59	3syl 19	. . . . . . 7 ⊢ ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (◡𝑅↑𝑟0) = ( I ↾ (dom ◡𝑅 ∪ ran ◡𝑅)))
61	57, 60	eqtrd 2796	. . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (◡𝑅↑𝑟𝑁) = ( I ↾ (dom ◡𝑅 ∪ ran ◡𝑅)))
62	51, 55, 61	3eqtr4a 2822	. . . . 5 ⊢ ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁))
63	62	ex 418	. . . 4 ⊢ (𝑁 = 0 → (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁)))
64	43, 63	jaoi 871	. . 3 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁)))
65	1, 64	sylbi 220	. 2 ⊢ (𝑁 ∈ ℕ0 → (𝑅 ∈ 𝑉 → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁)))
66	65	imp 412	1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ◡(𝑅↑𝑟𝑁) = (◡𝑅↑𝑟𝑁))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897   I cid 5545  ^◡ccnv 5650  dom cdm 5651  ran crn 5652   ↾ cres 5653   ∘ ccom 5655  (class class class)co 7420  0cc0 11200  1c1 11201   + caddc 11203  ℕcn 12335  ℕ₀cn0 12606  ↑_𝑟crelexp 15172

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-n0 12607  df-z 12694  df-uz 12966  df-seq 14145  df-relexp 15173

This theorem is used by:  relexpcnvd  15189  relexpnnrn  15198  relexpaddg  15206  cnvtrclfv  44723