relexpmulg - Mathbox for Richard Penner

	Mathbox for Richard Penner		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > relexpmulg		Structured version Visualization version GIF version

Theorem relexpmulg 44155

Description: With ordered exponents, the composition of powers of a relation is the relation raised to the product of exponents. (Contributed by RP, 13-Jun-2020.)

**Assertion**
Ref	Expression
relexpmulg	⊢ (((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) ∧ (𝐽 ∈ ℕ₀ ∧ 𝐾 ∈ ℕ₀)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))

**Proof of Theorem relexpmulg**
Step	Hyp	Ref	Expression
1		elnn0 12430	. . . 4 ⊢ (𝐽 ∈ ℕ₀ ↔ (𝐽 ∈ ℕ ∨ 𝐽 = 0))
2		elnn0 12430	. . . . . 6 ⊢ (𝐾 ∈ ℕ₀ ↔ (𝐾 ∈ ℕ ∨ 𝐾 = 0))
3		relexpmulnn 44154	. . . . . . . . . 10 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾)) ∧ (𝐽 ∈ ℕ ∧ 𝐾 ∈ ℕ)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))
4	3	3adantl3 1170	. . . . . . . . 9 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) ∧ (𝐽 ∈ ℕ ∧ 𝐾 ∈ ℕ)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))
5	4	expcom 413	. . . . . . . 8 ⊢ ((𝐽 ∈ ℕ ∧ 𝐾 ∈ ℕ) → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼)))
6	5	expcom 413	. . . . . . 7 ⊢ (𝐾 ∈ ℕ → (𝐽 ∈ ℕ → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))))
7		simprr 773	. . . . . . . . . . . . 13 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → 𝐼 = (𝐽 · 𝐾))
8		simpll 767	. . . . . . . . . . . . . 14 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → 𝐾 = 0)
9	8	oveq2d 7376	. . . . . . . . . . . . 13 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → (𝐽 · 𝐾) = (𝐽 · 0))
10		simplr 769	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → 𝐽 ∈ ℕ)
11	10	nncnd 12181	. . . . . . . . . . . . . 14 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → 𝐽 ∈ ℂ)
12	11	mul01d 11336	. . . . . . . . . . . . 13 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → (𝐽 · 0) = 0)
13	7, 9, 12	3eqtrd 2776	. . . . . . . . . . . 12 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → 𝐼 = 0)
14		simpl 482	. . . . . . . . . . . . 13 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → (𝐾 = 0 ∧ 𝐽 ∈ ℕ))
15		nnnle0 12201	. . . . . . . . . . . . . . 15 ⊢ (𝐽 ∈ ℕ → ¬ 𝐽 ≤ 0)
16	15	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝐾 = 0 ∧ 𝐽 ∈ ℕ) → ¬ 𝐽 ≤ 0)
17		simpl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 = 0 ∧ 𝐽 ∈ ℕ) → 𝐾 = 0)
18	17	breq2d 5098	. . . . . . . . . . . . . 14 ⊢ ((𝐾 = 0 ∧ 𝐽 ∈ ℕ) → (𝐽 ≤ 𝐾 ↔ 𝐽 ≤ 0))
19	16, 18	mtbird 325	. . . . . . . . . . . . 13 ⊢ ((𝐾 = 0 ∧ 𝐽 ∈ ℕ) → ¬ 𝐽 ≤ 𝐾)
20	14, 19	syl 17	. . . . . . . . . . . 12 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → ¬ 𝐽 ≤ 𝐾)
21	13, 20	jcnd 163	. . . . . . . . . . 11 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → ¬ (𝐼 = 0 → 𝐽 ≤ 𝐾))
22	21	pm2.21d 121	. . . . . . . . . 10 ⊢ (((𝐾 = 0 ∧ 𝐽 ∈ ℕ) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾))) → ((𝐼 = 0 → 𝐽 ≤ 𝐾) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼)))
23	22	exp32 420	. . . . . . . . 9 ⊢ ((𝐾 = 0 ∧ 𝐽 ∈ ℕ) → (𝑅 ∈ 𝑉 → (𝐼 = (𝐽 · 𝐾) → ((𝐼 = 0 → 𝐽 ≤ 𝐾) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼)))))
24	23	3impd 1350	. . . . . . . 8 ⊢ ((𝐾 = 0 ∧ 𝐽 ∈ ℕ) → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼)))
25	24	ex 412	. . . . . . 7 ⊢ (𝐾 = 0 → (𝐽 ∈ ℕ → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))))
26	6, 25	jaoi 858	. . . . . 6 ⊢ ((𝐾 ∈ ℕ ∨ 𝐾 = 0) → (𝐽 ∈ ℕ → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))))
27	2, 26	sylbi 217	. . . . 5 ⊢ (𝐾 ∈ ℕ₀ → (𝐽 ∈ ℕ → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))))
28		simplr 769	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → 𝐽 = 0)
29	28	oveq2d 7376	. . . . . . . . . 10 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (𝑅↑_𝑟𝐽) = (𝑅↑_𝑟0))
30		simpr1 1196	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → 𝑅 ∈ 𝑉)
31		relexp0g 14975	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → (𝑅↑_𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
32	30, 31	syl 17	. . . . . . . . . 10 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (𝑅↑_𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
33	29, 32	eqtrd 2772	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (𝑅↑_𝑟𝐽) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
34	33	oveq1d 7375	. . . . . . . 8 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑_𝑟𝐾))
35		dmexg 7845	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → dom 𝑅 ∈ V)
36		rnexg 7846	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → ran 𝑅 ∈ V)
37	35, 36	unexd 7701	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (dom 𝑅 ∪ ran 𝑅) ∈ V)
38	30, 37	syl 17	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (dom 𝑅 ∪ ran 𝑅) ∈ V)
39		simpll 767	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → 𝐾 ∈ ℕ₀)
40		relexpiidm 44149	. . . . . . . . 9 ⊢ (((dom 𝑅 ∪ ran 𝑅) ∈ V ∧ 𝐾 ∈ ℕ₀) → (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑_𝑟𝐾) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
41	38, 39, 40	syl2anc 585	. . . . . . . 8 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑_𝑟𝐾) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
42		simpr2 1197	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → 𝐼 = (𝐽 · 𝐾))
43	28	oveq1d 7375	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (𝐽 · 𝐾) = (0 · 𝐾))
44	39	nn0cnd 12491	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → 𝐾 ∈ ℂ)
45	44	mul02d 11335	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (0 · 𝐾) = 0)
46	42, 43, 45	3eqtrd 2776	. . . . . . . . . 10 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → 𝐼 = 0)
47	46	oveq2d 7376	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → (𝑅↑_𝑟𝐼) = (𝑅↑_𝑟0))
48	47, 32	eqtr2d 2773	. . . . . . . 8 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (𝑅↑_𝑟𝐼))
49	34, 41, 48	3eqtrd 2776	. . . . . . 7 ⊢ (((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) ∧ (𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾))) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))
50	49	ex 412	. . . . . 6 ⊢ ((𝐾 ∈ ℕ₀ ∧ 𝐽 = 0) → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼)))
51	50	ex 412	. . . . 5 ⊢ (𝐾 ∈ ℕ₀ → (𝐽 = 0 → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))))
52	27, 51	jaod 860	. . . 4 ⊢ (𝐾 ∈ ℕ₀ → ((𝐽 ∈ ℕ ∨ 𝐽 = 0) → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))))
53	1, 52	biimtrid 242	. . 3 ⊢ (𝐾 ∈ ℕ₀ → (𝐽 ∈ ℕ₀ → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))))
54	53	impcom 407	. 2 ⊢ ((𝐽 ∈ ℕ₀ ∧ 𝐾 ∈ ℕ₀) → ((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼)))
55	54	impcom 407	1 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝐼 = (𝐽 · 𝐾) ∧ (𝐼 = 0 → 𝐽 ≤ 𝐾)) ∧ (𝐽 ∈ ℕ₀ ∧ 𝐾 ∈ ℕ₀)) → ((𝑅↑_𝑟𝐽)↑_𝑟𝐾) = (𝑅↑_𝑟𝐼))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∪ cun 3888 class class class wbr 5086 I cid 5518 dom cdm 5624 ran crn 5625 ↾ cres 5626 (class class class)co 7360 0cc0 11029 · cmul 11034 ≤ cle 11171 ℕcn 12165 ℕ₀cn0 12428 ↑_𝑟crelexp 14972

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 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 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 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: (None)

W3C validator