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

Theorem relexp01min 41975
Description: With exponents limited to 0 and 1, the composition of powers of a relation is the relation raised to the minimum of exponents. (Contributed by RP, 12-Jun-2020.)
Assertion
Ref Expression
relexp01min (((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) ∧ (𝐽 ∈ {0, 1} ∧ 𝐾 ∈ {0, 1})) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))

Proof of Theorem relexp01min
StepHypRef Expression
1 elpri 4608 . . 3 (𝐽 ∈ {0, 1} → (𝐽 = 0 ∨ 𝐽 = 1))
2 elpri 4608 . . 3 (𝐾 ∈ {0, 1} → (𝐾 = 0 ∨ 𝐾 = 1))
3 dmresi 6005 . . . . . . . . . . 11 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
4 rnresi 6027 . . . . . . . . . . 11 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
53, 4uneq12i 4121 . . . . . . . . . 10 (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) = ((dom 𝑅 ∪ ran 𝑅) ∪ (dom 𝑅 ∪ ran 𝑅))
6 unidm 4112 . . . . . . . . . 10 ((dom 𝑅 ∪ ran 𝑅) ∪ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
75, 6eqtri 2764 . . . . . . . . 9 (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) = (dom 𝑅 ∪ ran 𝑅)
87reseq2i 5934 . . . . . . . 8 ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))
9 simp1 1136 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 0)
109oveq2d 7373 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟0))
11 simp3l 1201 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝑅𝑉)
12 relexp0g 14907 . . . . . . . . . . . 12 (𝑅𝑉 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
1311, 12syl 17 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
1410, 13eqtrd 2776 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
15 simp2 1137 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 0)
1614, 15oveq12d 7375 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑𝑟0))
17 dmexg 7840 . . . . . . . . . . . 12 (𝑅𝑉 → dom 𝑅 ∈ V)
18 rnexg 7841 . . . . . . . . . . . 12 (𝑅𝑉 → ran 𝑅 ∈ V)
1917, 18unexd 7688 . . . . . . . . . . 11 (𝑅𝑉 → (dom 𝑅 ∪ ran 𝑅) ∈ V)
2019resiexd 7166 . . . . . . . . . 10 (𝑅𝑉 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V)
21 relexp0g 14907 . . . . . . . . . 10 (( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V → (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑𝑟0) = ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))))
2211, 20, 213syl 18 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑𝑟0) = ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))))
2316, 22eqtrd 2776 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))))
24 simp3r 1202 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
25 0re 11157 . . . . . . . . . . . . . 14 0 ∈ ℝ
2625ltnri 11264 . . . . . . . . . . . . 13 ¬ 0 < 0
279, 15breq12d 5118 . . . . . . . . . . . . 13 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 0 < 0))
2826, 27mtbiri 326 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 𝐽 < 𝐾)
2928iffalsed 4497 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐾)
3024, 29, 153eqtrd 2780 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 0)
3130oveq2d 7373 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟0))
3231, 13eqtrd 2776 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
338, 23, 323eqtr4a 2802 . . . . . . 7 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
34333exp 1119 . . . . . 6 (𝐽 = 0 → (𝐾 = 0 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
35 simp1 1136 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 1)
3635oveq2d 7373 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟1))
37 simp3l 1201 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝑅𝑉)
3837relexp1d 14914 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟1) = 𝑅)
3936, 38eqtrd 2776 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = 𝑅)
40 simp2 1137 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 0)
4139, 40oveq12d 7375 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟0))
42 simp3r 1202 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
43 0lt1 11677 . . . . . . . . . . . . 13 0 < 1
44 1re 11155 . . . . . . . . . . . . . 14 1 ∈ ℝ
4525, 44ltnsymi 11274 . . . . . . . . . . . . 13 (0 < 1 → ¬ 1 < 0)
4643, 45mp1i 13 . . . . . . . . . . . 12 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 1 < 0)
4735, 40breq12d 5118 . . . . . . . . . . . 12 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 1 < 0))
4846, 47mtbird 324 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 𝐽 < 𝐾)
4948iffalsed 4497 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐾)
5042, 49, 403eqtrd 2780 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 0)
5150oveq2d 7373 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟0))
5241, 51eqtr4d 2779 . . . . . . 7 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
53523exp 1119 . . . . . 6 (𝐽 = 1 → (𝐾 = 0 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
5434, 53jaoi 855 . . . . 5 ((𝐽 = 0 ∨ 𝐽 = 1) → (𝐾 = 0 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
55 ovex 7390 . . . . . . . . 9 (𝑅𝑟0) ∈ V
56 relexp1g 14911 . . . . . . . . 9 ((𝑅𝑟0) ∈ V → ((𝑅𝑟0)↑𝑟1) = (𝑅𝑟0))
5755, 56mp1i 13 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟0)↑𝑟1) = (𝑅𝑟0))
58 simp1 1136 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 0)
5958oveq2d 7373 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟0))
60 simp2 1137 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 1)
6159, 60oveq12d 7375 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = ((𝑅𝑟0)↑𝑟1))
62 simp3r 1202 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
6358, 60breq12d 5118 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 0 < 1))
6443, 63mpbiri 257 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 < 𝐾)
6564iftrued 4494 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐽)
6662, 65, 583eqtrd 2780 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 0)
6766oveq2d 7373 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟0))
6857, 61, 673eqtr4d 2786 . . . . . . 7 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
69683exp 1119 . . . . . 6 (𝐽 = 0 → (𝐾 = 1 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
70 simp1 1136 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 1)
7170oveq2d 7373 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟1))
72 simp3l 1201 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝑅𝑉)
7372relexp1d 14914 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟1) = 𝑅)
7471, 73eqtrd 2776 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = 𝑅)
75 simp2 1137 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 1)
7674, 75oveq12d 7375 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟1))
77 simp3r 1202 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
7844ltnri 11264 . . . . . . . . . . . 12 ¬ 1 < 1
7970, 75breq12d 5118 . . . . . . . . . . . 12 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 1 < 1))
8078, 79mtbiri 326 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 𝐽 < 𝐾)
8180iffalsed 4497 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐾)
8277, 81, 753eqtrd 2780 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 1)
8382oveq2d 7373 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟1))
8476, 83eqtr4d 2779 . . . . . . 7 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
85843exp 1119 . . . . . 6 (𝐽 = 1 → (𝐾 = 1 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
8669, 85jaoi 855 . . . . 5 ((𝐽 = 0 ∨ 𝐽 = 1) → (𝐾 = 1 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
8754, 86jaod 857 . . . 4 ((𝐽 = 0 ∨ 𝐽 = 1) → ((𝐾 = 0 ∨ 𝐾 = 1) → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
8887imp 407 . . 3 (((𝐽 = 0 ∨ 𝐽 = 1) ∧ (𝐾 = 0 ∨ 𝐾 = 1)) → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼)))
891, 2, 88syl2an 596 . 2 ((𝐽 ∈ {0, 1} ∧ 𝐾 ∈ {0, 1}) → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼)))
9089impcom 408 1 (((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) ∧ (𝐽 ∈ {0, 1} ∧ 𝐾 ∈ {0, 1})) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wo 845  w3a 1087   = wceq 1541  wcel 2106  Vcvv 3445  cun 3908  ifcif 4486  {cpr 4588   class class class wbr 5105   I cid 5530  dom cdm 5633  ran crn 5634  cres 5635  (class class class)co 7357  0cc0 11051  1c1 11052   < clt 11189  𝑟crelexp 14904
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-n0 12414  df-z 12500  df-uz 12764  df-seq 13907  df-relexp 14905
This theorem is referenced by:  relexp1idm  41976  relexp0idm  41977
  Copyright terms: Public domain W3C validator