MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relexpsucnnr Structured version   Visualization version   GIF version

Theorem relexpsucnnr 14978
Description: A reduction for relation exponentiation to the right. (Contributed by RP, 22-May-2020.)
Assertion
Ref Expression
relexpsucnnr ((𝑅𝑉𝑁 ∈ ℕ) → (𝑅𝑟(𝑁 + 1)) = ((𝑅𝑟𝑁) ∘ 𝑅))

Proof of Theorem relexpsucnnr
Dummy variables 𝑎 𝑏 𝑧 𝑛 𝑟 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2740 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))))
2 simprr 778 . . . . 5 (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅𝑛 = (𝑁 + 1))) → 𝑛 = (𝑁 + 1))
3 dmeq 5845 . . . . . . . . . . 11 (𝑟 = 𝑅 → dom 𝑟 = dom 𝑅)
4 rneq 5878 . . . . . . . . . . 11 (𝑟 = 𝑅 → ran 𝑟 = ran 𝑅)
53, 4uneq12d 4099 . . . . . . . . . 10 (𝑟 = 𝑅 → (dom 𝑟 ∪ ran 𝑟) = (dom 𝑅 ∪ ran 𝑅))
65reseq2d 5931 . . . . . . . . 9 (𝑟 = 𝑅 → ( I ↾ (dom 𝑟 ∪ ran 𝑟)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
7 eqidd 2740 . . . . . . . . . . 11 (𝑟 = 𝑅 → 1 = 1)
8 coeq2 5800 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (𝑥𝑟) = (𝑥𝑅))
98mpoeq3dv 7435 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)) = (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)))
10 id 22 . . . . . . . . . . . 12 (𝑟 = 𝑅𝑟 = 𝑅)
1110mpteq2dv 5166 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑧 ∈ V ↦ 𝑟) = (𝑧 ∈ V ↦ 𝑅))
127, 9, 11seqeq123d 13963 . . . . . . . . . 10 (𝑟 = 𝑅 → seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟)) = seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅)))
1312fveq1d 6829 . . . . . . . . 9 (𝑟 = 𝑅 → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘(𝑁 + 1)) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)))
146, 13ifeq12d 4476 . . . . . . . 8 (𝑟 = 𝑅 → if((𝑁 + 1) = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘(𝑁 + 1))) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1))))
1514ad2antrl 734 . . . . . . 7 (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅 ∧ (𝑁 + 1) = (𝑁 + 1))) → if((𝑁 + 1) = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘(𝑁 + 1))) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1))))
1615a1i 11 . . . . . 6 (𝑛 = (𝑁 + 1) → (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅 ∧ (𝑁 + 1) = (𝑁 + 1))) → if((𝑁 + 1) = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘(𝑁 + 1))) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)))))
17 eqeq1 2743 . . . . . . . 8 (𝑛 = (𝑁 + 1) → (𝑛 = (𝑁 + 1) ↔ (𝑁 + 1) = (𝑁 + 1)))
1817anbi2d 636 . . . . . . 7 (𝑛 = (𝑁 + 1) → ((𝑟 = 𝑅𝑛 = (𝑁 + 1)) ↔ (𝑟 = 𝑅 ∧ (𝑁 + 1) = (𝑁 + 1))))
1918anbi2d 636 . . . . . 6 (𝑛 = (𝑁 + 1) → (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅𝑛 = (𝑁 + 1))) ↔ ((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅 ∧ (𝑁 + 1) = (𝑁 + 1)))))
20 eqeq1 2743 . . . . . . . 8 (𝑛 = (𝑁 + 1) → (𝑛 = 0 ↔ (𝑁 + 1) = 0))
21 fveq2 6827 . . . . . . . 8 (𝑛 = (𝑁 + 1) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘(𝑁 + 1)))
2220, 21ifbieq2d 4481 . . . . . . 7 (𝑛 = (𝑁 + 1) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘(𝑁 + 1))))
2322eqeq1d 2741 . . . . . 6 (𝑛 = (𝑁 + 1) → (if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1))) ↔ if((𝑁 + 1) = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘(𝑁 + 1))) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)))))
2416, 19, 233imtr4d 295 . . . . 5 (𝑛 = (𝑁 + 1) → (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅𝑛 = (𝑁 + 1))) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)))))
252, 24mpcom 38 . . . 4 (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅𝑛 = (𝑁 + 1))) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1))))
26 elex 3452 . . . . 5 (𝑅𝑉𝑅 ∈ V)
2726adantr 481 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → 𝑅 ∈ V)
28 simpr 485 . . . . . 6 ((𝑅𝑉𝑁 ∈ ℕ) → 𝑁 ∈ ℕ)
2928peano2nnd 12182 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑁 + 1) ∈ ℕ)
3029nnnn0d 12489 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑁 + 1) ∈ ℕ0)
31 dmexg 7841 . . . . . . . 8 (𝑅𝑉 → dom 𝑅 ∈ V)
32 rnexg 7842 . . . . . . . 8 (𝑅𝑉 → ran 𝑅 ∈ V)
33 unexg 7686 . . . . . . . 8 ((dom 𝑅 ∈ V ∧ ran 𝑅 ∈ V) → (dom 𝑅 ∪ ran 𝑅) ∈ V)
3431, 32, 33syl2anc 590 . . . . . . 7 (𝑅𝑉 → (dom 𝑅 ∪ ran 𝑅) ∈ V)
35 resiexg 7852 . . . . . . 7 ((dom 𝑅 ∪ ran 𝑅) ∈ V → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V)
3634, 35syl 17 . . . . . 6 (𝑅𝑉 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V)
3736adantr 481 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V)
38 fvexd 6842 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)) ∈ V)
3937, 38ifcld 4501 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1))) ∈ V)
401, 25, 27, 30, 39ovmpod 7508 . . 3 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))(𝑁 + 1)) = if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1))))
41 nnne0 12202 . . . . . 6 ((𝑁 + 1) ∈ ℕ → (𝑁 + 1) ≠ 0)
4241neneqd 2939 . . . . 5 ((𝑁 + 1) ∈ ℕ → ¬ (𝑁 + 1) = 0)
4329, 42syl 17 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → ¬ (𝑁 + 1) = 0)
4443iffalsed 4465 . . 3 ((𝑅𝑉𝑁 ∈ ℕ) → if((𝑁 + 1) = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1))) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)))
45 elnnuz 12819 . . . . . 6 (𝑁 ∈ ℕ ↔ 𝑁 ∈ (ℤ‘1))
4645bilani 505 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → 𝑁 ∈ (ℤ‘1))
47 seqp1 13969 . . . . 5 (𝑁 ∈ (ℤ‘1) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)) = ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅))((𝑧 ∈ V ↦ 𝑅)‘(𝑁 + 1))))
4846, 47syl 17 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)) = ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅))((𝑧 ∈ V ↦ 𝑅)‘(𝑁 + 1))))
49 ovex 7389 . . . . . 6 (𝑁 + 1) ∈ V
50 simpl 483 . . . . . 6 ((𝑅𝑉𝑁 ∈ ℕ) → 𝑅𝑉)
51 eqidd 2740 . . . . . . 7 (𝑧 = (𝑁 + 1) → 𝑅 = 𝑅)
52 eqid 2739 . . . . . . 7 (𝑧 ∈ V ↦ 𝑅) = (𝑧 ∈ V ↦ 𝑅)
5351, 52fvmptg 6933 . . . . . 6 (((𝑁 + 1) ∈ V ∧ 𝑅𝑉) → ((𝑧 ∈ V ↦ 𝑅)‘(𝑁 + 1)) = 𝑅)
5449, 50, 53sylancr 593 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → ((𝑧 ∈ V ↦ 𝑅)‘(𝑁 + 1)) = 𝑅)
5554oveq2d 7372 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅))((𝑧 ∈ V ↦ 𝑅)‘(𝑁 + 1))) = ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅))𝑅))
56 nfcv 2901 . . . . . . 7 𝑎(𝑥𝑅)
57 nfcv 2901 . . . . . . 7 𝑏(𝑥𝑅)
58 nfcv 2901 . . . . . . 7 𝑥(𝑎𝑅)
59 nfcv 2901 . . . . . . 7 𝑦(𝑎𝑅)
60 simpl 483 . . . . . . . 8 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝑥 = 𝑎)
6160coeq1d 5803 . . . . . . 7 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑥𝑅) = (𝑎𝑅))
6256, 57, 58, 59, 61cbvmpo 7450 . . . . . 6 (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)) = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎𝑅))
63 oveq 7362 . . . . . 6 ((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)) = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎𝑅)) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅))𝑅) = ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎𝑅))𝑅))
6462, 63mp1i 13 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅))𝑅) = ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎𝑅))𝑅))
65 eqidd 2740 . . . . . 6 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎𝑅)) = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎𝑅)))
66 simprl 776 . . . . . . 7 (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑎 = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∧ 𝑏 = 𝑅)) → 𝑎 = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁))
6766coeq1d 5803 . . . . . 6 (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑎 = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∧ 𝑏 = 𝑅)) → (𝑎𝑅) = ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∘ 𝑅))
68 fvexd 6842 . . . . . 6 ((𝑅𝑉𝑁 ∈ ℕ) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∈ V)
69 fvex 6840 . . . . . . 7 (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∈ V
70 coexg 7869 . . . . . . 7 (((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∈ V ∧ 𝑅𝑉) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∘ 𝑅) ∈ V)
7169, 50, 70sylancr 593 . . . . . 6 ((𝑅𝑉𝑁 ∈ ℕ) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∘ 𝑅) ∈ V)
7265, 67, 68, 27, 71ovmpod 7508 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎𝑅))𝑅) = ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∘ 𝑅))
73 simpr 485 . . . . . . . . . . 11 ((𝑟 = 𝑅𝑛 = 𝑁) → 𝑛 = 𝑁)
7473eqeq1d 2741 . . . . . . . . . 10 ((𝑟 = 𝑅𝑛 = 𝑁) → (𝑛 = 0 ↔ 𝑁 = 0))
756adantr 481 . . . . . . . . . 10 ((𝑟 = 𝑅𝑛 = 𝑁) → ( I ↾ (dom 𝑟 ∪ ran 𝑟)) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
7612adantr 481 . . . . . . . . . . 11 ((𝑟 = 𝑅𝑛 = 𝑁) → seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟)) = seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅)))
7776, 73fveq12d 6834 . . . . . . . . . 10 ((𝑟 = 𝑅𝑛 = 𝑁) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁))
7874, 75, 77ifbieq12d 4483 . . . . . . . . 9 ((𝑟 = 𝑅𝑛 = 𝑁) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = if(𝑁 = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)))
7978adantl 482 . . . . . . . 8 (((𝑅𝑉𝑁 ∈ ℕ) ∧ (𝑟 = 𝑅𝑛 = 𝑁)) → if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)) = if(𝑁 = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)))
8028nnnn0d 12489 . . . . . . . 8 ((𝑅𝑉𝑁 ∈ ℕ) → 𝑁 ∈ ℕ0)
8137, 68ifcld 4501 . . . . . . . 8 ((𝑅𝑉𝑁 ∈ ℕ) → if(𝑁 = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)) ∈ V)
821, 79, 27, 80, 81ovmpod 7508 . . . . . . 7 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) = if(𝑁 = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)))
83 nnne0 12202 . . . . . . . . . 10 (𝑁 ∈ ℕ → 𝑁 ≠ 0)
8483adantl 482 . . . . . . . . 9 ((𝑅𝑉𝑁 ∈ ℕ) → 𝑁 ≠ 0)
8584neneqd 2939 . . . . . . . 8 ((𝑅𝑉𝑁 ∈ ℕ) → ¬ 𝑁 = 0)
8685iffalsed 4465 . . . . . . 7 ((𝑅𝑉𝑁 ∈ ℕ) → if(𝑁 = 0, ( I ↾ (dom 𝑅 ∪ ran 𝑅)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)) = (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁))
8782, 86eqtr2d 2775 . . . . . 6 ((𝑅𝑉𝑁 ∈ ℕ) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) = (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁))
8887coeq1d 5803 . . . . 5 ((𝑅𝑉𝑁 ∈ ℕ) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁) ∘ 𝑅) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅))
8964, 72, 883eqtrd 2778 . . . 4 ((𝑅𝑉𝑁 ∈ ℕ) → ((seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘𝑁)(𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅))𝑅) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅))
9048, 55, 893eqtrd 2778 . . 3 ((𝑅𝑉𝑁 ∈ ℕ) → (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑅)), (𝑧 ∈ V ↦ 𝑅))‘(𝑁 + 1)) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅))
9140, 44, 903eqtrd 2778 . 2 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))(𝑁 + 1)) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅))
92 df-relexp 14973 . . 3 𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))
93 oveq 7362 . . . . 5 (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → (𝑅𝑟(𝑁 + 1)) = (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))(𝑁 + 1)))
94 oveq 7362 . . . . . 6 (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → (𝑅𝑟𝑁) = (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁))
9594coeq1d 5803 . . . . 5 (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → ((𝑅𝑟𝑁) ∘ 𝑅) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅))
9693, 95eqeq12d 2755 . . . 4 (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → ((𝑅𝑟(𝑁 + 1)) = ((𝑅𝑟𝑁) ∘ 𝑅) ↔ (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))(𝑁 + 1)) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅)))
9796imbi2d 341 . . 3 (↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) → (((𝑅𝑉𝑁 ∈ ℕ) → (𝑅𝑟(𝑁 + 1)) = ((𝑅𝑟𝑁) ∘ 𝑅)) ↔ ((𝑅𝑉𝑁 ∈ ℕ) → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))(𝑁 + 1)) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅))))
9892, 97ax-mp 5 . 2 (((𝑅𝑉𝑁 ∈ ℕ) → (𝑅𝑟(𝑁 + 1)) = ((𝑅𝑟𝑁) ∘ 𝑅)) ↔ ((𝑅𝑉𝑁 ∈ ℕ) → (𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))(𝑁 + 1)) = ((𝑅(𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))𝑁) ∘ 𝑅)))
9991, 98mpbir 232 1 ((𝑅𝑉𝑁 ∈ ℕ) → (𝑅𝑟(𝑁 + 1)) = ((𝑅𝑟𝑁) ∘ 𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wne 2934  Vcvv 3431  cun 3881  ifcif 4454  cmpt 5153   I cid 5512  dom cdm 5618  ran crn 5619  cres 5620  ccom 5622  cfv 6485  (class class class)co 7356  cmpo 7358  0cc0 11029  1c1 11030   + caddc 11032  cn 12165  0cn0 12428  cuz 12779  seqcseq 13954  𝑟crelexp 14972
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-n0 12429  df-z 12516  df-uz 12780  df-seq 13955  df-relexp 14973
This theorem is referenced by:  relexpsucnnl  14983  relexpsucr  14985  relexpcnv  14988  relexprelg  14991  relexpnndm  14994  relexp2  44121  relexpxpnnidm  44147  relexpss1d  44149  relexpmulnn  44153  trclrelexplem  44155  relexp0a  44160  trclfvcom  44167  cotrcltrcl  44169  trclfvdecomr  44172  cotrclrcl  44186
  Copyright terms: Public domain W3C validator