Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > relexpsucr | Structured version Visualization version GIF version |
Description: A reduction for relation exponentiation to the right. (Contributed by RP, 23-May-2020.) |
Ref | Expression |
---|---|
relexpsucr | ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅 ∧ 𝑁 ∈ ℕ0) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnn0 12336 | . . . 4 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
2 | simp3 1137 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉) | |
3 | simp1 1135 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑁 ∈ ℕ) | |
4 | relexpsucnnr 14835 | . . . . . . 7 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅)) | |
5 | 2, 3, 4 | syl2anc 584 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅)) |
6 | 5 | 3expib 1121 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅))) |
7 | simp2 1136 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → Rel 𝑅) | |
8 | relcoi2 6215 | . . . . . . . . 9 ⊢ (Rel 𝑅 → (( I ↾ ∪ ∪ 𝑅) ∘ 𝑅) = 𝑅) | |
9 | 8 | eqcomd 2742 | . . . . . . . 8 ⊢ (Rel 𝑅 → 𝑅 = (( I ↾ ∪ ∪ 𝑅) ∘ 𝑅)) |
10 | 7, 9 | syl 17 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑅 = (( I ↾ ∪ ∪ 𝑅) ∘ 𝑅)) |
11 | simp1 1135 | . . . . . . . . . . 11 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑁 = 0) | |
12 | 11 | oveq1d 7352 | . . . . . . . . . 10 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑁 + 1) = (0 + 1)) |
13 | 0p1e1 12196 | . . . . . . . . . 10 ⊢ (0 + 1) = 1 | |
14 | 12, 13 | eqtrdi 2792 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑁 + 1) = 1) |
15 | 14 | oveq2d 7353 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅↑𝑟1)) |
16 | simp3 1137 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉) | |
17 | relexp1g 14836 | . . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅) | |
18 | 16, 17 | syl 17 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟1) = 𝑅) |
19 | 15, 18 | eqtrd 2776 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = 𝑅) |
20 | 11 | oveq2d 7353 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = (𝑅↑𝑟0)) |
21 | relexp0 14833 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅) → (𝑅↑𝑟0) = ( I ↾ ∪ ∪ 𝑅)) | |
22 | 16, 7, 21 | syl2anc 584 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟0) = ( I ↾ ∪ ∪ 𝑅)) |
23 | 20, 22 | eqtrd 2776 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = ( I ↾ ∪ ∪ 𝑅)) |
24 | 23 | coeq1d 5803 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → ((𝑅↑𝑟𝑁) ∘ 𝑅) = (( I ↾ ∪ ∪ 𝑅) ∘ 𝑅)) |
25 | 10, 19, 24 | 3eqtr4d 2786 | . . . . . 6 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅)) |
26 | 25 | 3expib 1121 | . . . . 5 ⊢ (𝑁 = 0 → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅))) |
27 | 6, 26 | jaoi 854 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅))) |
28 | 1, 27 | sylbi 216 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅))) |
29 | 28 | 3impib 1115 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅)) |
30 | 29 | 3com13 1123 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅 ∧ 𝑁 ∈ ℕ0) → (𝑅↑𝑟(𝑁 + 1)) = ((𝑅↑𝑟𝑁) ∘ 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∨ wo 844 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 ∪ cuni 4852 I cid 5517 ↾ cres 5622 ∘ ccom 5624 Rel wrel 5625 (class class class)co 7337 0cc0 10972 1c1 10973 + caddc 10975 ℕcn 12074 ℕ0cn0 12334 ↑𝑟crelexp 14829 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5243 ax-nul 5250 ax-pow 5308 ax-pr 5372 ax-un 7650 ax-cnex 11028 ax-resscn 11029 ax-1cn 11030 ax-icn 11031 ax-addcl 11032 ax-addrcl 11033 ax-mulcl 11034 ax-mulrcl 11035 ax-mulcom 11036 ax-addass 11037 ax-mulass 11038 ax-distr 11039 ax-i2m1 11040 ax-1ne0 11041 ax-1rid 11042 ax-rnegex 11043 ax-rrecex 11044 ax-cnre 11045 ax-pre-lttri 11046 ax-pre-lttrn 11047 ax-pre-ltadd 11048 ax-pre-mulgt0 11049 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4270 df-if 4474 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4853 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5176 df-tr 5210 df-id 5518 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5575 df-we 5577 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6238 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6431 df-fun 6481 df-fn 6482 df-f 6483 df-f1 6484 df-fo 6485 df-f1o 6486 df-fv 6487 df-riota 7293 df-ov 7340 df-oprab 7341 df-mpo 7342 df-om 7781 df-2nd 7900 df-frecs 8167 df-wrecs 8198 df-recs 8272 df-rdg 8311 df-er 8569 df-en 8805 df-dom 8806 df-sdom 8807 df-pnf 11112 df-mnf 11113 df-xr 11114 df-ltxr 11115 df-le 11116 df-sub 11308 df-neg 11309 df-nn 12075 df-n0 12335 df-z 12421 df-uz 12684 df-seq 13823 df-relexp 14830 |
This theorem is referenced by: relexpsucrd 14843 |
Copyright terms: Public domain | W3C validator |