![]() |
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 15005 | . . 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 771 | . . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑛 = 1) | |
4 | ax-1ne0 11213 | . . . . . . 7 ⊢ 1 ≠ 0 | |
5 | neeq1 2999 | . . . . . . 7 ⊢ (𝑛 = 1 → (𝑛 ≠ 0 ↔ 1 ≠ 0)) | |
6 | 4, 5 | mpbiri 257 | . . . . . 6 ⊢ (𝑛 = 1 → 𝑛 ≠ 0) |
7 | 3, 6 | syl 17 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑛 ≠ 0) |
8 | 7 | neneqd 2941 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → ¬ 𝑛 = 0) |
9 | 8 | iffalsed 4541 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) |
10 | simprl 769 | . . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑟 = 𝑅) | |
11 | 10 | mpteq2dv 5252 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (𝑧 ∈ V ↦ 𝑟) = (𝑧 ∈ V ↦ 𝑅)) |
12 | 11 | seqeq3d 14012 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟)) = seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑅))) |
13 | 12, 3 | fveq12d 6907 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑅))‘1)) |
14 | 1z 12628 | . . . 4 ⊢ 1 ∈ ℤ | |
15 | eqidd 2728 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (𝑧 ∈ V ↦ 𝑅) = (𝑧 ∈ V ↦ 𝑅)) | |
16 | eqidd 2728 | . . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) ∧ 𝑧 = 1) → 𝑅 = 𝑅) | |
17 | 1ex 11246 | . . . . . 6 ⊢ 1 ∈ V | |
18 | 17 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 1 ∈ V) |
19 | simpl 481 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → 𝑅 ∈ 𝑉) | |
20 | 15, 16, 18, 19 | fvmptd 7015 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → ((𝑧 ∈ V ↦ 𝑅)‘1) = 𝑅) |
21 | 14, 20 | seq1i 14018 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑅))‘1) = 𝑅) |
22 | 9, 13, 21 | 3eqtrd 2771 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ (𝑟 = 𝑅 ∧ 𝑛 = 1)) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = 𝑅) |
23 | elex 3490 | . 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
24 | 1nn0 12524 | . . 3 ⊢ 1 ∈ ℕ0 | |
25 | 24 | a1i 11 | . 2 ⊢ (𝑅 ∈ 𝑉 → 1 ∈ ℕ0) |
26 | 2, 22, 23, 25, 23 | ovmpod 7577 | 1 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2936 Vcvv 3471 ∪ cun 3945 ifcif 4530 ↦ cmpt 5233 I cid 5577 dom cdm 5680 ran crn 5681 ↾ cres 5682 ∘ ccom 5684 ‘cfv 6551 (class class class)co 7424 ∈ cmpo 7426 0cc0 11144 1c1 11145 ℕ0cn0 12508 seqcseq 14004 ↑𝑟crelexp 15004 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2698 ax-sep 5301 ax-nul 5308 ax-pow 5367 ax-pr 5431 ax-un 7744 ax-cnex 11200 ax-resscn 11201 ax-1cn 11202 ax-icn 11203 ax-addcl 11204 ax-addrcl 11205 ax-mulcl 11206 ax-mulrcl 11207 ax-mulcom 11208 ax-addass 11209 ax-mulass 11210 ax-distr 11211 ax-i2m1 11212 ax-1ne0 11213 ax-1rid 11214 ax-rnegex 11215 ax-rrecex 11216 ax-cnre 11217 ax-pre-lttri 11218 ax-pre-lttrn 11219 ax-pre-ltadd 11220 ax-pre-mulgt0 11221 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4911 df-iun 5000 df-br 5151 df-opab 5213 df-mpt 5234 df-tr 5268 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-we 5637 df-xp 5686 df-rel 5687 df-cnv 5688 df-co 5689 df-dm 5690 df-rn 5691 df-res 5692 df-ima 5693 df-pred 6308 df-ord 6375 df-on 6376 df-lim 6377 df-suc 6378 df-iota 6503 df-fun 6553 df-fn 6554 df-f 6555 df-f1 6556 df-fo 6557 df-f1o 6558 df-fv 6559 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7875 df-2nd 7998 df-frecs 8291 df-wrecs 8322 df-recs 8396 df-rdg 8435 df-er 8729 df-en 8969 df-dom 8970 df-sdom 8971 df-pnf 11286 df-mnf 11287 df-xr 11288 df-ltxr 11289 df-le 11290 df-sub 11482 df-neg 11483 df-nn 12249 df-n0 12509 df-z 12595 df-uz 12859 df-seq 14005 df-relexp 15005 |
This theorem is referenced by: dfid5 15012 dfid6 15013 relexp1d 15014 relexpsucnnl 15015 relexpsucl 15016 relexpsucr 15017 relexpcnv 15020 relexprelg 15023 relexpnndm 15026 relexpfld 15034 relexpaddnn 15036 relexpaddg 15038 dfrcl3 43108 relexp2 43110 iunrelexp0 43135 relexpxpnnidm 43136 corclrcl 43140 iunrelexpmin1 43141 trclrelexplem 43144 iunrelexpmin2 43145 relexp01min 43146 relexp0a 43149 relexpaddss 43151 dftrcl3 43153 cotrcltrcl 43158 trclimalb2 43159 trclfvdecomr 43161 dfrtrcl3 43166 corcltrcl 43172 cotrclrcl 43175 |
Copyright terms: Public domain | W3C validator |