| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relexpnndm | Structured version Visualization version GIF version | ||
| Description: The domain of an exponentiation of a relation a subset of the relation's field. (Contributed by RP, 23-May-2020.) |
| Ref | Expression |
|---|---|
| relexpnndm | ⊢ ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 7406 | . . . . . 6 ⊢ (𝑛 = 1 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟1)) | |
| 2 | 1 | dmeqd 5883 | . . . . 5 ⊢ (𝑛 = 1 → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟1)) |
| 3 | 2 | sseq1d 3969 | . . . 4 ⊢ (𝑛 = 1 → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟1) ⊆ dom 𝑅)) |
| 4 | 3 | imbi2d 342 | . . 3 ⊢ (𝑛 = 1 → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟1) ⊆ dom 𝑅))) |
| 5 | oveq2 7406 | . . . . . 6 ⊢ (𝑛 = 𝑚 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟𝑚)) | |
| 6 | 5 | dmeqd 5883 | . . . . 5 ⊢ (𝑛 = 𝑚 → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟𝑚)) |
| 7 | 6 | sseq1d 3969 | . . . 4 ⊢ (𝑛 = 𝑚 → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅)) |
| 8 | 7 | imbi2d 342 | . . 3 ⊢ (𝑛 = 𝑚 → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅))) |
| 9 | oveq2 7406 | . . . . . 6 ⊢ (𝑛 = (𝑚 + 1) → (𝑅↑𝑟𝑛) = (𝑅↑𝑟(𝑚 + 1))) | |
| 10 | 9 | dmeqd 5883 | . . . . 5 ⊢ (𝑛 = (𝑚 + 1) → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟(𝑚 + 1))) |
| 11 | 10 | sseq1d 3969 | . . . 4 ⊢ (𝑛 = (𝑚 + 1) → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅)) |
| 12 | 11 | imbi2d 342 | . . 3 ⊢ (𝑛 = (𝑚 + 1) → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅))) |
| 13 | oveq2 7406 | . . . . . 6 ⊢ (𝑛 = 𝑁 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟𝑁)) | |
| 14 | 13 | dmeqd 5883 | . . . . 5 ⊢ (𝑛 = 𝑁 → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟𝑁)) |
| 15 | 14 | sseq1d 3969 | . . . 4 ⊢ (𝑛 = 𝑁 → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅)) |
| 16 | 15 | imbi2d 342 | . . 3 ⊢ (𝑛 = 𝑁 → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅))) |
| 17 | relexp1g 15041 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅) | |
| 18 | 17 | dmeqd 5883 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟1) = dom 𝑅) |
| 19 | eqimss 3996 | . . . 4 ⊢ (dom (𝑅↑𝑟1) = dom 𝑅 → dom (𝑅↑𝑟1) ⊆ dom 𝑅) | |
| 20 | 18, 19 | syl 17 | . . 3 ⊢ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟1) ⊆ dom 𝑅) |
| 21 | relexpsucnnr 15040 | . . . . . . . . 9 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑚 ∈ ℕ) → (𝑅↑𝑟(𝑚 + 1)) = ((𝑅↑𝑟𝑚) ∘ 𝑅)) | |
| 22 | 21 | ancoms 462 | . . . . . . . 8 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑚 + 1)) = ((𝑅↑𝑟𝑚) ∘ 𝑅)) |
| 23 | 22 | dmeqd 5883 | . . . . . . 7 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟(𝑚 + 1)) = dom ((𝑅↑𝑟𝑚) ∘ 𝑅)) |
| 24 | dmcoss 5953 | . . . . . . 7 ⊢ dom ((𝑅↑𝑟𝑚) ∘ 𝑅) ⊆ dom 𝑅 | |
| 25 | 23, 24 | eqsstrdi 3982 | . . . . . 6 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅) |
| 26 | 25 | a1d 25 | . . . . 5 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → (dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅)) |
| 27 | 26 | ex 416 | . . . 4 ⊢ (𝑚 ∈ ℕ → (𝑅 ∈ 𝑉 → (dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅))) |
| 28 | 27 | a2d 29 | . . 3 ⊢ (𝑚 ∈ ℕ → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅) → (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅))) |
| 29 | 4, 8, 12, 16, 20, 28 | nnind 12230 | . 2 ⊢ (𝑁 ∈ ℕ → (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅)) |
| 30 | 29 | imp 410 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1562 ∈ wcel 2144 ⊆ wss 3906 dom cdm 5649 ∘ ccom 5653 (class class class)co 7398 1c1 11076 + caddc 11078 ℕcn 12212 ↑𝑟crelexp 15034 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-nn 12213 df-n0 12484 df-z 12571 df-uz 12842 df-seq 14017 df-relexp 15035 |
| This theorem is referenced by: relexpdmg 15057 relexpnnrn 15060 relexpfld 15064 relexpaddg 15068 relexpaddss 44299 |
| Copyright terms: Public domain | W3C validator |