![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > relexp1g | Structured version Visualization version GIF version |
Description: A relation composed once is itself. (Contributed by RP, 22-May-2020.) |
Ref | Expression |
---|---|
relexp1g | ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-relexp 15055 | . . 3 ⊢ ↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) | |
2 | 1 | a1i 11 | . 2 ⊢ (𝑅 ∈ 𝑉 → ↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))) |
3 | simprr 773 | . . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑛 = 1) | |
4 | ax-1ne0 11221 | . . . . . . 7 ⊢ 1 ≠ 0 | |
5 | neeq1 3000 | . . . . . . 7 ⊢ (𝑛 = 1 → (𝑛 ≠ 0 ↔ 1 ≠ 0)) | |
6 | 4, 5 | mpbiri 258 | . . . . . 6 ⊢ (𝑛 = 1 → 𝑛 ≠ 0) |
7 | 3, 6 | syl 17 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑛 ≠ 0) |
8 | 7 | neneqd 2942 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → ¬ 𝑛 = 0) |
9 | 8 | iffalsed 4541 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) |
10 | simprl 771 | . . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑟 = 𝑅) | |
11 | 10 | mpteq2dv 5249 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (𝑧 ∈ V ↦ 𝑟) = (𝑧 ∈ V ↦ 𝑅)) |
12 | 11 | seqeq3d 14046 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟)) = seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑅))) |
13 | 12, 3 | fveq12d 6913 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑅))‘1)) |
14 | 1z 12644 | . . . 4 ⊢ 1 ∈ ℤ | |
15 | eqidd 2735 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (𝑧 ∈ V ↦ 𝑅) = (𝑧 ∈ V ↦ 𝑅)) | |
16 | eqidd 2735 | . . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) ∧ 𝑧 = 1) → 𝑅 = 𝑅) | |
17 | 1ex 11254 | . . . . . 6 ⊢ 1 ∈ V | |
18 | 17 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 1 ∈ V) |
19 | simpl 482 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑅 ∈ 𝑉) | |
20 | 15, 16, 18, 19 | fvmptd 7022 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → ((𝑧 ∈ V ↦ 𝑅)‘1) = 𝑅) |
21 | 14, 20 | seq1i 14052 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑅))‘1) = 𝑅) |
22 | 9, 13, 21 | 3eqtrd 2778 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = 𝑅) |
23 | elex 3498 | . 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
24 | 1nn0 12539 | . . 3 ⊢ 1 ∈ ℕ0 | |
25 | 24 | a1i 11 | . 2 ⊢ (𝑅 ∈ 𝑉 → 1 ∈ ℕ0) |
26 | 2, 22, 23, 25, 23 | ovmpod 7584 | 1 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1536 ∈ wcel 2105 ≠ wne 2937 Vcvv 3477 ∪ cun 3960 ifcif 4530 ↦ cmpt 5230 I cid 5581 dom cdm 5688 ran crn 5689 ↾ cres 5690 ∘ ccom 5692 ‘cfv 6562 (class class class)co 7430 ∈ cmpo 7432 0cc0 11152 1c1 11153 ℕ0cn0 12523 seqcseq 14038 ↑𝑟crelexp 15054 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-nn 12264 df-n0 12524 df-z 12611 df-uz 12876 df-seq 14039 df-relexp 15055 |
This theorem is referenced by: dfid5 15062 dfid6 15063 relexp1d 15064 relexpsucnnl 15065 relexpsucl 15066 relexpsucr 15067 relexpcnv 15070 relexprelg 15073 relexpnndm 15076 relexpfld 15084 relexpaddnn 15086 relexpaddg 15088 dfrcl3 43664 relexp2 43666 iunrelexp0 43691 relexpxpnnidm 43692 corclrcl 43696 iunrelexpmin1 43697 trclrelexplem 43700 iunrelexpmin2 43701 relexp01min 43702 relexp0a 43705 relexpaddss 43707 dftrcl3 43709 cotrcltrcl 43714 trclimalb2 43715 trclfvdecomr 43717 dfrtrcl3 43722 corcltrcl 43728 cotrclrcl 43731 |
Copyright terms: Public domain | W3C validator |