| 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 7421 | . . . . . 6 ⊢ (𝑛 = 1 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟1)) | |
| 2 | 1 | dmeqd 5898 | . . . . 5 ⊢ (𝑛 = 1 → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟1)) |
| 3 | 2 | sseq1d 3976 | . . . 4 ⊢ (𝑛 = 1 → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟1) ⊆ dom 𝑅)) |
| 4 | 3 | imbi2d 343 | . . 3 ⊢ (𝑛 = 1 → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟1) ⊆ dom 𝑅))) |
| 5 | oveq2 7421 | . . . . . 6 ⊢ (𝑛 = 𝑚 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟𝑚)) | |
| 6 | 5 | dmeqd 5898 | . . . . 5 ⊢ (𝑛 = 𝑚 → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟𝑚)) |
| 7 | 6 | sseq1d 3976 | . . . 4 ⊢ (𝑛 = 𝑚 → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅)) |
| 8 | 7 | imbi2d 343 | . . 3 ⊢ (𝑛 = 𝑚 → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅))) |
| 9 | oveq2 7421 | . . . . . 6 ⊢ (𝑛 = (𝑚 + 1) → (𝑅↑𝑟𝑛) = (𝑅↑𝑟(𝑚 + 1))) | |
| 10 | 9 | dmeqd 5898 | . . . . 5 ⊢ (𝑛 = (𝑚 + 1) → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟(𝑚 + 1))) |
| 11 | 10 | sseq1d 3976 | . . . 4 ⊢ (𝑛 = (𝑚 + 1) → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅)) |
| 12 | 11 | imbi2d 343 | . . 3 ⊢ (𝑛 = (𝑚 + 1) → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅))) |
| 13 | oveq2 7421 | . . . . . 6 ⊢ (𝑛 = 𝑁 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟𝑁)) | |
| 14 | 13 | dmeqd 5898 | . . . . 5 ⊢ (𝑛 = 𝑁 → dom (𝑅↑𝑟𝑛) = dom (𝑅↑𝑟𝑁)) |
| 15 | 14 | sseq1d 3976 | . . . 4 ⊢ (𝑛 = 𝑁 → (dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅 ↔ dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅)) |
| 16 | 15 | imbi2d 343 | . . 3 ⊢ (𝑛 = 𝑁 → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑛) ⊆ dom 𝑅) ↔ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅))) |
| 17 | relexp1g 15065 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅) | |
| 18 | 17 | dmeqd 5898 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟1) = dom 𝑅) |
| 19 | eqimss 4003 | . . . 4 ⊢ (dom (𝑅↑𝑟1) = dom 𝑅 → dom (𝑅↑𝑟1) ⊆ dom 𝑅) | |
| 20 | 18, 19 | syl 18 | . . 3 ⊢ (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟1) ⊆ dom 𝑅) |
| 21 | relexpsucnnr 15064 | . . . . . . . . 9 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑚 ∈ ℕ) → (𝑅↑𝑟(𝑚 + 1)) = ((𝑅↑𝑟𝑚) ∘ 𝑅)) | |
| 22 | 21 | ancoms 463 | . . . . . . . 8 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟(𝑚 + 1)) = ((𝑅↑𝑟𝑚) ∘ 𝑅)) |
| 23 | 22 | dmeqd 5898 | . . . . . . 7 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟(𝑚 + 1)) = dom ((𝑅↑𝑟𝑚) ∘ 𝑅)) |
| 24 | dmcoss 5968 | . . . . . . 7 ⊢ dom ((𝑅↑𝑟𝑚) ∘ 𝑅) ⊆ dom 𝑅 | |
| 25 | 23, 24 | eqsstrdi 3989 | . . . . . 6 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅) |
| 26 | 25 | a1d 26 | . . . . 5 ⊢ ((𝑚 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → (dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅)) |
| 27 | 26 | ex 417 | . . . 4 ⊢ (𝑚 ∈ ℕ → (𝑅 ∈ 𝑉 → (dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅))) |
| 28 | 27 | a2d 30 | . . 3 ⊢ (𝑚 ∈ ℕ → ((𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑚) ⊆ dom 𝑅) → (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟(𝑚 + 1)) ⊆ dom 𝑅))) |
| 29 | 4, 8, 12, 16, 20, 28 | nnind 12253 | . 2 ⊢ (𝑁 ∈ ℕ → (𝑅 ∈ 𝑉 → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅)) |
| 30 | 29 | imp 411 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 dom cdm 5664 ∘ ccom 5668 (class class class)co 7413 1c1 11103 + caddc 11105 ℕcn 12235 ↑𝑟crelexp 15058 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5273 ax-pow 5339 ax-pr 5407 ax-un 7735 ax-cnex 11158 ax-resscn 11159 ax-1cn 11160 ax-icn 11161 ax-addcl 11162 ax-addrcl 11163 ax-mulcl 11164 ax-mulrcl 11165 ax-mulcom 11166 ax-addass 11167 ax-mulass 11168 ax-distr 11169 ax-i2m1 11170 ax-1ne0 11171 ax-1rid 11172 ax-rnegex 11173 ax-rrecex 11174 ax-cnre 11175 ax-pre-lttri 11176 ax-pre-lttrn 11177 ax-pre-ltadd 11178 ax-pre-mulgt0 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6305 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11445 df-neg 11446 df-nn 12236 df-n0 12507 df-z 12594 df-uz 12865 df-seq 14040 df-relexp 15059 |
| This theorem is referenced by: relexpdmg 15081 relexpnnrn 15084 relexpfld 15088 relexpaddg 15092 relexpaddss 44373 |
| Copyright terms: Public domain | W3C validator |