| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relexpaddd | Structured version Visualization version GIF version | ||
| Description: Relation composition becomes addition under exponentiation. (Contributed by Drahflow, 12-Nov-2015.) (Revised by RP, 30-May-2020.) (Revised by AV, 12-Jul-2024.) |
| Ref | Expression |
|---|---|
| relexpaddd.1 | ⊢ (𝜑 → Rel 𝑅) |
| relexpaddd.2 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| relexpaddd.3 | ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| Ref | Expression |
|---|---|
| relexpaddd | ⊢ (𝜑 → ((𝑅↑𝑟𝑁) ∘ (𝑅↑𝑟𝑀)) = (𝑅↑𝑟(𝑁 + 𝑀))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relexpaddd.2 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 2 | 1 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑁 ∈ ℕ0) |
| 3 | relexpaddd.3 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ0) | |
| 4 | 3 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑀 ∈ ℕ0) |
| 5 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑅 ∈ V) | |
| 6 | relexpaddd.1 | . . . . . 6 ⊢ (𝜑 → Rel 𝑅) | |
| 7 | 6 | a1d 25 | . . . . 5 ⊢ (𝜑 → ((𝑁 + 𝑀) = 1 → Rel 𝑅)) |
| 8 | 7 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → ((𝑁 + 𝑀) = 1 → Rel 𝑅)) |
| 9 | relexpaddg 14978 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑀 ∈ ℕ0 ∧ 𝑅 ∈ V ∧ ((𝑁 + 𝑀) = 1 → Rel 𝑅))) → ((𝑅↑𝑟𝑁) ∘ (𝑅↑𝑟𝑀)) = (𝑅↑𝑟(𝑁 + 𝑀))) | |
| 10 | 2, 4, 5, 8, 9 | syl13anc 1375 | . . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → ((𝑅↑𝑟𝑁) ∘ (𝑅↑𝑟𝑀)) = (𝑅↑𝑟(𝑁 + 𝑀))) |
| 11 | 10 | ex 412 | . 2 ⊢ (𝜑 → (𝑅 ∈ V → ((𝑅↑𝑟𝑁) ∘ (𝑅↑𝑟𝑀)) = (𝑅↑𝑟(𝑁 + 𝑀)))) |
| 12 | co01 6219 | . . 3 ⊢ (∅ ∘ ∅) = ∅ | |
| 13 | reldmrelexp 14946 | . . . . 5 ⊢ Rel dom ↑𝑟 | |
| 14 | 13 | ovprc1 7397 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑅↑𝑟𝑁) = ∅) |
| 15 | 13 | ovprc1 7397 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑅↑𝑟𝑀) = ∅) |
| 16 | 14, 15 | coeq12d 5812 | . . 3 ⊢ (¬ 𝑅 ∈ V → ((𝑅↑𝑟𝑁) ∘ (𝑅↑𝑟𝑀)) = (∅ ∘ ∅)) |
| 17 | 13 | ovprc1 7397 | . . 3 ⊢ (¬ 𝑅 ∈ V → (𝑅↑𝑟(𝑁 + 𝑀)) = ∅) |
| 18 | 12, 16, 17 | 3eqtr4a 2796 | . 2 ⊢ (¬ 𝑅 ∈ V → ((𝑅↑𝑟𝑁) ∘ (𝑅↑𝑟𝑀)) = (𝑅↑𝑟(𝑁 + 𝑀))) |
| 19 | 11, 18 | pm2.61d1 180 | 1 ⊢ (𝜑 → ((𝑅↑𝑟𝑁) ∘ (𝑅↑𝑟𝑀)) = (𝑅↑𝑟(𝑁 + 𝑀))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3439 ∅c0 4284 ∘ ccom 5627 Rel wrel 5628 (class class class)co 7358 1c1 11029 + caddc 11031 ℕ0cn0 12403 ↑𝑟crelexp 14944 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-2 12210 df-n0 12404 df-z 12491 df-uz 12754 df-seq 13927 df-relexp 14945 |
| This theorem is referenced by: rtrclreclem3 14985 relexpnul 43956 |
| Copyright terms: Public domain | W3C validator |