![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > relexpsucl | Structured version Visualization version GIF version |
Description: A reduction for relation exponentiation to the left. (Contributed by RP, 23-May-2020.) |
Ref | Expression |
---|---|
relexpsucl | ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅 ∧ 𝑁 ∈ ℕ0) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnn0 11619 | . . . 4 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
2 | simp3 1174 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉) | |
3 | simp1 1172 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑁 ∈ ℕ) | |
4 | relexpsucnnl 14148 | . . . . . . 7 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) | |
5 | 2, 3, 4 | syl2anc 581 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
6 | 5 | 3expib 1158 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁)))) |
7 | simp2 1173 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → Rel 𝑅) | |
8 | relcoi1 5904 | . . . . . . . 8 ⊢ (Rel 𝑅 → (𝑅 ∘ ( I ↾ ∪ ∪ 𝑅)) = 𝑅) | |
9 | 7, 8 | syl 17 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅 ∘ ( I ↾ ∪ ∪ 𝑅)) = 𝑅) |
10 | simp1 1172 | . . . . . . . . . 10 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑁 = 0) | |
11 | 10 | oveq2d 6920 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = (𝑅↑𝑟0)) |
12 | simp3 1174 | . . . . . . . . . 10 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉) | |
13 | relexp0 14139 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅) → (𝑅↑𝑟0) = ( I ↾ ∪ ∪ 𝑅)) | |
14 | 12, 7, 13 | syl2anc 581 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟0) = ( I ↾ ∪ ∪ 𝑅)) |
15 | 11, 14 | eqtrd 2860 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = ( I ↾ ∪ ∪ 𝑅)) |
16 | 15 | coeq2d 5516 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅 ∘ (𝑅↑𝑟𝑁)) = (𝑅 ∘ ( I ↾ ∪ ∪ 𝑅))) |
17 | 10 | oveq1d 6919 | . . . . . . . . . 10 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑁 + 1) = (0 + 1)) |
18 | 0p1e1 11479 | . . . . . . . . . 10 ⊢ (0 + 1) = 1 | |
19 | 17, 18 | syl6eq 2876 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑁 + 1) = 1) |
20 | 19 | oveq2d 6920 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅↑𝑟1)) |
21 | relexp1g 14142 | . . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅) | |
22 | 12, 21 | syl 17 | . . . . . . . 8 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟1) = 𝑅) |
23 | 20, 22 | eqtrd 2860 | . . . . . . 7 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = 𝑅) |
24 | 9, 16, 23 | 3eqtr4rd 2871 | . . . . . 6 ⊢ ((𝑁 = 0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
25 | 24 | 3expib 1158 | . . . . 5 ⊢ (𝑁 = 0 → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁)))) |
26 | 6, 25 | jaoi 890 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁)))) |
27 | 1, 26 | sylbi 209 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁)))) |
28 | 27 | 3impib 1150 | . 2 ⊢ ((𝑁 ∈ ℕ0 ∧ Rel 𝑅 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
29 | 28 | 3com13 1160 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅 ∧ 𝑁 ∈ ℕ0) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∨ wo 880 ∧ w3a 1113 = wceq 1658 ∈ wcel 2166 ∪ cuni 4657 I cid 5248 ↾ cres 5343 ∘ ccom 5345 Rel wrel 5346 (class class class)co 6904 0cc0 10251 1c1 10252 + caddc 10254 ℕcn 11349 ℕ0cn0 11617 ↑𝑟crelexp 14136 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2390 ax-ext 2802 ax-sep 5004 ax-nul 5012 ax-pow 5064 ax-pr 5126 ax-un 7208 ax-cnex 10307 ax-resscn 10308 ax-1cn 10309 ax-icn 10310 ax-addcl 10311 ax-addrcl 10312 ax-mulcl 10313 ax-mulrcl 10314 ax-mulcom 10315 ax-addass 10316 ax-mulass 10317 ax-distr 10318 ax-i2m1 10319 ax-1ne0 10320 ax-1rid 10321 ax-rnegex 10322 ax-rrecex 10323 ax-cnre 10324 ax-pre-lttri 10325 ax-pre-lttrn 10326 ax-pre-ltadd 10327 ax-pre-mulgt0 10328 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3or 1114 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2604 df-eu 2639 df-clab 2811 df-cleq 2817 df-clel 2820 df-nfc 2957 df-ne 2999 df-nel 3102 df-ral 3121 df-rex 3122 df-reu 3123 df-rab 3125 df-v 3415 df-sbc 3662 df-csb 3757 df-dif 3800 df-un 3802 df-in 3804 df-ss 3811 df-pss 3813 df-nul 4144 df-if 4306 df-pw 4379 df-sn 4397 df-pr 4399 df-tp 4401 df-op 4403 df-uni 4658 df-iun 4741 df-br 4873 df-opab 4935 df-mpt 4952 df-tr 4975 df-id 5249 df-eprel 5254 df-po 5262 df-so 5263 df-fr 5300 df-we 5302 df-xp 5347 df-rel 5348 df-cnv 5349 df-co 5350 df-dm 5351 df-rn 5352 df-res 5353 df-ima 5354 df-pred 5919 df-ord 5965 df-on 5966 df-lim 5967 df-suc 5968 df-iota 6085 df-fun 6124 df-fn 6125 df-f 6126 df-f1 6127 df-fo 6128 df-f1o 6129 df-fv 6130 df-riota 6865 df-ov 6907 df-oprab 6908 df-mpt2 6909 df-om 7326 df-2nd 7428 df-wrecs 7671 df-recs 7733 df-rdg 7771 df-er 8008 df-en 8222 df-dom 8223 df-sdom 8224 df-pnf 10392 df-mnf 10393 df-xr 10394 df-ltxr 10395 df-le 10396 df-sub 10586 df-neg 10587 df-nn 11350 df-n0 11618 df-z 11704 df-uz 11968 df-seq 13095 df-relexp 14137 |
This theorem is referenced by: relexpsucld 14150 relexpindlem 14179 |
Copyright terms: Public domain | W3C validator |