MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relexpcnv Structured version   Visualization version   GIF version

Theorem relexpcnv 14978
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.
StepHypRef Expression
1 elnn0 12470 . . 3 (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2 oveq2 7413 . . . . . . . 8 (𝑛 = 1 → (𝑅𝑟𝑛) = (𝑅𝑟1))
32cnveqd 5873 . . . . . . 7 (𝑛 = 1 → (𝑅𝑟𝑛) = (𝑅𝑟1))
4 oveq2 7413 . . . . . . 7 (𝑛 = 1 → (𝑅𝑟𝑛) = (𝑅𝑟1))
53, 4eqeq12d 2748 . . . . . 6 (𝑛 = 1 → ((𝑅𝑟𝑛) = (𝑅𝑟𝑛) ↔ (𝑅𝑟1) = (𝑅𝑟1)))
65imbi2d 340 . . . . 5 (𝑛 = 1 → ((𝑅𝑉(𝑅𝑟𝑛) = (𝑅𝑟𝑛)) ↔ (𝑅𝑉(𝑅𝑟1) = (𝑅𝑟1))))
7 oveq2 7413 . . . . . . . 8 (𝑛 = 𝑚 → (𝑅𝑟𝑛) = (𝑅𝑟𝑚))
87cnveqd 5873 . . . . . . 7 (𝑛 = 𝑚(𝑅𝑟𝑛) = (𝑅𝑟𝑚))
9 oveq2 7413 . . . . . . 7 (𝑛 = 𝑚 → (𝑅𝑟𝑛) = (𝑅𝑟𝑚))
108, 9eqeq12d 2748 . . . . . 6 (𝑛 = 𝑚 → ((𝑅𝑟𝑛) = (𝑅𝑟𝑛) ↔ (𝑅𝑟𝑚) = (𝑅𝑟𝑚)))
1110imbi2d 340 . . . . 5 (𝑛 = 𝑚 → ((𝑅𝑉(𝑅𝑟𝑛) = (𝑅𝑟𝑛)) ↔ (𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚))))
12 oveq2 7413 . . . . . . . 8 (𝑛 = (𝑚 + 1) → (𝑅𝑟𝑛) = (𝑅𝑟(𝑚 + 1)))
1312cnveqd 5873 . . . . . . 7 (𝑛 = (𝑚 + 1) → (𝑅𝑟𝑛) = (𝑅𝑟(𝑚 + 1)))
14 oveq2 7413 . . . . . . 7 (𝑛 = (𝑚 + 1) → (𝑅𝑟𝑛) = (𝑅𝑟(𝑚 + 1)))
1513, 14eqeq12d 2748 . . . . . 6 (𝑛 = (𝑚 + 1) → ((𝑅𝑟𝑛) = (𝑅𝑟𝑛) ↔ (𝑅𝑟(𝑚 + 1)) = (𝑅𝑟(𝑚 + 1))))
1615imbi2d 340 . . . . 5 (𝑛 = (𝑚 + 1) → ((𝑅𝑉(𝑅𝑟𝑛) = (𝑅𝑟𝑛)) ↔ (𝑅𝑉(𝑅𝑟(𝑚 + 1)) = (𝑅𝑟(𝑚 + 1)))))
17 oveq2 7413 . . . . . . . 8 (𝑛 = 𝑁 → (𝑅𝑟𝑛) = (𝑅𝑟𝑁))
1817cnveqd 5873 . . . . . . 7 (𝑛 = 𝑁(𝑅𝑟𝑛) = (𝑅𝑟𝑁))
19 oveq2 7413 . . . . . . 7 (𝑛 = 𝑁 → (𝑅𝑟𝑛) = (𝑅𝑟𝑁))
2018, 19eqeq12d 2748 . . . . . 6 (𝑛 = 𝑁 → ((𝑅𝑟𝑛) = (𝑅𝑟𝑛) ↔ (𝑅𝑟𝑁) = (𝑅𝑟𝑁)))
2120imbi2d 340 . . . . 5 (𝑛 = 𝑁 → ((𝑅𝑉(𝑅𝑟𝑛) = (𝑅𝑟𝑛)) ↔ (𝑅𝑉(𝑅𝑟𝑁) = (𝑅𝑟𝑁))))
22 relexp1g 14969 . . . . . . 7 (𝑅𝑉 → (𝑅𝑟1) = 𝑅)
2322cnveqd 5873 . . . . . 6 (𝑅𝑉(𝑅𝑟1) = 𝑅)
24 cnvexg 7911 . . . . . . 7 (𝑅𝑉𝑅 ∈ V)
25 relexp1g 14969 . . . . . . 7 (𝑅 ∈ V → (𝑅𝑟1) = 𝑅)
2624, 25syl 17 . . . . . 6 (𝑅𝑉 → (𝑅𝑟1) = 𝑅)
2723, 26eqtr4d 2775 . . . . 5 (𝑅𝑉(𝑅𝑟1) = (𝑅𝑟1))
28 cnvco 5883 . . . . . . . . 9 ((𝑅𝑟𝑚) ∘ 𝑅) = (𝑅(𝑅𝑟𝑚))
29 simp3 1138 . . . . . . . . . 10 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → (𝑅𝑟𝑚) = (𝑅𝑟𝑚))
3029coeq2d 5860 . . . . . . . . 9 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → (𝑅(𝑅𝑟𝑚)) = (𝑅 ∘ (𝑅𝑟𝑚)))
3128, 30eqtrid 2784 . . . . . . . 8 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → ((𝑅𝑟𝑚) ∘ 𝑅) = (𝑅 ∘ (𝑅𝑟𝑚)))
32 simp2 1137 . . . . . . . . . 10 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → 𝑅𝑉)
33 simp1 1136 . . . . . . . . . 10 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → 𝑚 ∈ ℕ)
34 relexpsucnnr 14968 . . . . . . . . . 10 ((𝑅𝑉𝑚 ∈ ℕ) → (𝑅𝑟(𝑚 + 1)) = ((𝑅𝑟𝑚) ∘ 𝑅))
3532, 33, 34syl2anc 584 . . . . . . . . 9 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → (𝑅𝑟(𝑚 + 1)) = ((𝑅𝑟𝑚) ∘ 𝑅))
3635cnveqd 5873 . . . . . . . 8 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → (𝑅𝑟(𝑚 + 1)) = ((𝑅𝑟𝑚) ∘ 𝑅))
3732, 24syl 17 . . . . . . . . 9 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → 𝑅 ∈ V)
38 relexpsucnnl 14973 . . . . . . . . 9 ((𝑅 ∈ V ∧ 𝑚 ∈ ℕ) → (𝑅𝑟(𝑚 + 1)) = (𝑅 ∘ (𝑅𝑟𝑚)))
3937, 33, 38syl2anc 584 . . . . . . . 8 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → (𝑅𝑟(𝑚 + 1)) = (𝑅 ∘ (𝑅𝑟𝑚)))
4031, 36, 393eqtr4d 2782 . . . . . . 7 ((𝑚 ∈ ℕ ∧ 𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → (𝑅𝑟(𝑚 + 1)) = (𝑅𝑟(𝑚 + 1)))
41403exp 1119 . . . . . 6 (𝑚 ∈ ℕ → (𝑅𝑉 → ((𝑅𝑟𝑚) = (𝑅𝑟𝑚) → (𝑅𝑟(𝑚 + 1)) = (𝑅𝑟(𝑚 + 1)))))
4241a2d 29 . . . . 5 (𝑚 ∈ ℕ → ((𝑅𝑉(𝑅𝑟𝑚) = (𝑅𝑟𝑚)) → (𝑅𝑉(𝑅𝑟(𝑚 + 1)) = (𝑅𝑟(𝑚 + 1)))))
436, 11, 16, 21, 27, 42nnind 12226 . . . 4 (𝑁 ∈ ℕ → (𝑅𝑉(𝑅𝑟𝑁) = (𝑅𝑟𝑁)))
44 cnvresid 6624 . . . . . . 7 ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))
45 uncom 4152 . . . . . . . . 9 (dom 𝑅 ∪ ran 𝑅) = (ran 𝑅 ∪ dom 𝑅)
46 df-rn 5686 . . . . . . . . . 10 ran 𝑅 = dom 𝑅
47 dfdm4 5893 . . . . . . . . . 10 dom 𝑅 = ran 𝑅
4846, 47uneq12i 4160 . . . . . . . . 9 (ran 𝑅 ∪ dom 𝑅) = (dom 𝑅 ∪ ran 𝑅)
4945, 48eqtri 2760 . . . . . . . 8 (dom 𝑅 ∪ ran 𝑅) = (dom 𝑅 ∪ ran 𝑅)
5049reseq2i 5976 . . . . . . 7 ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))
5144, 50eqtri 2760 . . . . . 6 ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))
52 oveq2 7413 . . . . . . . 8 (𝑁 = 0 → (𝑅𝑟𝑁) = (𝑅𝑟0))
53 relexp0g 14965 . . . . . . . 8 (𝑅𝑉 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
5452, 53sylan9eq 2792 . . . . . . 7 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
5554cnveqd 5873 . . . . . 6 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
56 oveq2 7413 . . . . . . . 8 (𝑁 = 0 → (𝑅𝑟𝑁) = (𝑅𝑟0))
5756adantr 481 . . . . . . 7 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = (𝑅𝑟0))
58 simpr 485 . . . . . . . 8 ((𝑁 = 0 ∧ 𝑅𝑉) → 𝑅𝑉)
59 relexp0g 14965 . . . . . . . 8 (𝑅 ∈ V → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
6058, 24, 593syl 18 . . . . . . 7 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
6157, 60eqtrd 2772 . . . . . 6 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
6251, 55, 613eqtr4a 2798 . . . . 5 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = (𝑅𝑟𝑁))
6362ex 413 . . . 4 (𝑁 = 0 → (𝑅𝑉(𝑅𝑟𝑁) = (𝑅𝑟𝑁)))
6443, 63jaoi 855 . . 3 ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝑅𝑉(𝑅𝑟𝑁) = (𝑅𝑟𝑁)))
651, 64sylbi 216 . 2 (𝑁 ∈ ℕ0 → (𝑅𝑉(𝑅𝑟𝑁) = (𝑅𝑟𝑁)))
6665imp 407 1 ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) = (𝑅𝑟𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 845  w3a 1087   = wceq 1541  wcel 2106  Vcvv 3474  cun 3945   I cid 5572  ccnv 5674  dom cdm 5675  ran crn 5676  cres 5677  ccom 5679  (class class class)co 7405  0cc0 11106  1c1 11107   + caddc 11109  cn 12208  0cn0 12468  𝑟crelexp 14962
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-er 8699  df-en 8936  df-dom 8937  df-sdom 8938  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-nn 12209  df-n0 12469  df-z 12555  df-uz 12819  df-seq 13963  df-relexp 14963
This theorem is referenced by:  relexpcnvd  14979  relexpnnrn  14988  relexpaddg  14996  cnvtrclfv  42460
  Copyright terms: Public domain W3C validator