| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relexpsucld | Structured version Visualization version GIF version | ||
| Description: A reduction for relation exponentiation to the left. (Contributed by Drahflow, 12-Nov-2015.) (Revised by RP, 30-May-2020.) (Revised by AV, 12-Jul-2024.) |
| Ref | Expression |
|---|---|
| relexpsucrd.1 | ⊢ (𝜑 → Rel 𝑅) |
| relexpsucrd.2 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| Ref | Expression |
|---|---|
| relexpsucld | ⊢ (𝜑 → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑅 ∈ V) | |
| 2 | relexpsucrd.1 | . . . . 5 ⊢ (𝜑 → Rel 𝑅) | |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → Rel 𝑅) |
| 4 | relexpsucrd.2 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 5 | 4 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑁 ∈ ℕ0) |
| 6 | relexpsucl 15193 | . . . 4 ⊢ ((𝑅 ∈ V ∧ Rel 𝑅 ∧ 𝑁 ∈ ℕ0) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) | |
| 7 | 1, 3, 5, 6 | syl3anc 1398 | . . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
| 8 | 7 | ex 418 | . 2 ⊢ (𝜑 → (𝑅 ∈ V → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁)))) |
| 9 | reldmrelexp 15183 | . . . 4 ⊢ Rel dom ↑𝑟 | |
| 10 | 9 | ovprc1 7463 | . . 3 ⊢ (¬ 𝑅 ∈ V → (𝑅↑𝑟(𝑁 + 1)) = ∅) |
| 11 | 9 | ovprc1 7463 | . . . . 5 ⊢ (¬ 𝑅 ∈ V → (𝑅↑𝑟𝑁) = ∅) |
| 12 | 11 | coeq2d 5841 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑅 ∘ (𝑅↑𝑟𝑁)) = (𝑅 ∘ ∅)) |
| 13 | co02 6265 | . . . 4 ⊢ (𝑅 ∘ ∅) = ∅ | |
| 14 | 12, 13 | eqtr2di 2812 | . . 3 ⊢ (¬ 𝑅 ∈ V → ∅ = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
| 15 | 10, 14 | eqtrd 2795 | . 2 ⊢ (¬ 𝑅 ∈ V → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
| 16 | 8, 15 | pm2.61d1 182 | 1 ⊢ (𝜑 → (𝑅↑𝑟(𝑁 + 1)) = (𝑅 ∘ (𝑅↑𝑟𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4277 ∘ ccom 5655 Rel wrel 5656 (class class class)co 7424 1c1 11208 + caddc 11210 ℕ0cn0 12613 ↑𝑟crelexp 15181 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 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 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-n0 12614 df-z 12701 df-uz 12973 df-seq 14152 df-relexp 15182 |
| This theorem is used by: relexpindlem 15225 |
| Copyright terms: Public domain | W3C validator |