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 39569
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 4498 . . 3 (𝐽 ∈ {0, 1} → (𝐽 = 0 ∨ 𝐽 = 1))
2 elpri 4498 . . 3 (𝐾 ∈ {0, 1} → (𝐾 = 0 ∨ 𝐾 = 1))
3 dmresi 5804 . . . . . . . . . . 11 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
4 rnresi 5824 . . . . . . . . . . 11 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
53, 4uneq12i 4062 . . . . . . . . . 10 (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) = ((dom 𝑅 ∪ ran 𝑅) ∪ (dom 𝑅 ∪ ran 𝑅))
6 unidm 4053 . . . . . . . . . 10 ((dom 𝑅 ∪ ran 𝑅) ∪ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
75, 6eqtri 2819 . . . . . . . . 9 (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) = (dom 𝑅 ∪ ran 𝑅)
87reseq2i 5736 . . . . . . . 8 ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))
9 simp1 1129 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 0)
109oveq2d 7037 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟0))
11 simp3l 1194 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝑅𝑉)
12 relexp0g 14220 . . . . . . . . . . . 12 (𝑅𝑉 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
1311, 12syl 17 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
1410, 13eqtrd 2831 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
15 simp2 1130 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 0)
1614, 15oveq12d 7039 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑𝑟0))
17 dmexg 7474 . . . . . . . . . . . 12 (𝑅𝑉 → dom 𝑅 ∈ V)
18 rnexg 7475 . . . . . . . . . . . 12 (𝑅𝑉 → ran 𝑅 ∈ V)
19 unexg 7334 . . . . . . . . . . . 12 ((dom 𝑅 ∈ V ∧ ran 𝑅 ∈ V) → (dom 𝑅 ∪ ran 𝑅) ∈ V)
2017, 18, 19syl2anc 584 . . . . . . . . . . 11 (𝑅𝑉 → (dom 𝑅 ∪ ran 𝑅) ∈ V)
2120resiexd 6850 . . . . . . . . . 10 (𝑅𝑉 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V)
22 relexp0g 14220 . . . . . . . . . 10 (( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∈ V → (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑𝑟0) = ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))))
2311, 21, 223syl 18 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (( I ↾ (dom 𝑅 ∪ ran 𝑅))↑𝑟0) = ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))))
2416, 23eqtrd 2831 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = ( I ↾ (dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∪ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))))
25 simp3r 1195 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
26 0re 10494 . . . . . . . . . . . . . 14 0 ∈ ℝ
2726ltnri 10601 . . . . . . . . . . . . 13 ¬ 0 < 0
289, 15breq12d 4979 . . . . . . . . . . . . 13 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 0 < 0))
2927, 28mtbiri 328 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 𝐽 < 𝐾)
3029iffalsed 4396 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐾)
3125, 30, 153eqtrd 2835 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 0)
3231oveq2d 7037 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟0))
3332, 13eqtrd 2831 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
348, 24, 333eqtr4a 2857 . . . . . . 7 ((𝐽 = 0 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
35343exp 1112 . . . . . 6 (𝐽 = 0 → (𝐾 = 0 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
36 simp1 1129 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 1)
3736oveq2d 7037 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟1))
38 simp3l 1194 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝑅𝑉)
39 relexp1g 14224 . . . . . . . . . . 11 (𝑅𝑉 → (𝑅𝑟1) = 𝑅)
4038, 39syl 17 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟1) = 𝑅)
4137, 40eqtrd 2831 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = 𝑅)
42 simp2 1130 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 0)
4341, 42oveq12d 7039 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟0))
44 simp3r 1195 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
45 0lt1 11015 . . . . . . . . . . . . 13 0 < 1
46 1re 10492 . . . . . . . . . . . . . 14 1 ∈ ℝ
4726, 46ltnsymi 10611 . . . . . . . . . . . . 13 (0 < 1 → ¬ 1 < 0)
4845, 47mp1i 13 . . . . . . . . . . . 12 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 1 < 0)
4936, 42breq12d 4979 . . . . . . . . . . . 12 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 1 < 0))
5048, 49mtbird 326 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 𝐽 < 𝐾)
5150iffalsed 4396 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐾)
5244, 51, 423eqtrd 2835 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 0)
5352oveq2d 7037 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟0))
5443, 53eqtr4d 2834 . . . . . . 7 ((𝐽 = 1 ∧ 𝐾 = 0 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
55543exp 1112 . . . . . 6 (𝐽 = 1 → (𝐾 = 0 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
5635, 55jaoi 852 . . . . 5 ((𝐽 = 0 ∨ 𝐽 = 1) → (𝐾 = 0 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
57 ovex 7053 . . . . . . . . 9 (𝑅𝑟0) ∈ V
58 relexp1g 14224 . . . . . . . . 9 ((𝑅𝑟0) ∈ V → ((𝑅𝑟0)↑𝑟1) = (𝑅𝑟0))
5957, 58mp1i 13 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟0)↑𝑟1) = (𝑅𝑟0))
60 simp1 1129 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 0)
6160oveq2d 7037 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟0))
62 simp2 1130 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 1)
6361, 62oveq12d 7039 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = ((𝑅𝑟0)↑𝑟1))
64 simp3r 1195 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
6560, 62breq12d 4979 . . . . . . . . . . . 12 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 0 < 1))
6645, 65mpbiri 259 . . . . . . . . . . 11 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 < 𝐾)
6766iftrued 4393 . . . . . . . . . 10 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐽)
6864, 67, 603eqtrd 2835 . . . . . . . . 9 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 0)
6968oveq2d 7037 . . . . . . . 8 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟0))
7059, 63, 693eqtr4d 2841 . . . . . . 7 ((𝐽 = 0 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
71703exp 1112 . . . . . 6 (𝐽 = 0 → (𝐾 = 1 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
72 simp1 1129 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐽 = 1)
7372oveq2d 7037 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = (𝑅𝑟1))
74 simp3l 1194 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝑅𝑉)
7574, 39syl 17 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟1) = 𝑅)
7673, 75eqtrd 2831 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐽) = 𝑅)
77 simp2 1130 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐾 = 1)
7876, 77oveq12d 7039 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟1))
79 simp3r 1195 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))
8046ltnri 10601 . . . . . . . . . . . 12 ¬ 1 < 1
8172, 77breq12d 4979 . . . . . . . . . . . 12 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝐽 < 𝐾 ↔ 1 < 1))
8280, 81mtbiri 328 . . . . . . . . . . 11 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ¬ 𝐽 < 𝐾)
8382iffalsed 4396 . . . . . . . . . 10 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → if(𝐽 < 𝐾, 𝐽, 𝐾) = 𝐾)
8479, 83, 773eqtrd 2835 . . . . . . . . 9 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → 𝐼 = 1)
8584oveq2d 7037 . . . . . . . 8 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → (𝑅𝑟𝐼) = (𝑅𝑟1))
8678, 85eqtr4d 2834 . . . . . . 7 ((𝐽 = 1 ∧ 𝐾 = 1 ∧ (𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾))) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
87863exp 1112 . . . . . 6 (𝐽 = 1 → (𝐾 = 1 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
8871, 87jaoi 852 . . . . 5 ((𝐽 = 0 ∨ 𝐽 = 1) → (𝐾 = 1 → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
8956, 88jaod 854 . . . 4 ((𝐽 = 0 ∨ 𝐽 = 1) → ((𝐾 = 0 ∨ 𝐾 = 1) → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))))
9089imp 407 . . 3 (((𝐽 = 0 ∨ 𝐽 = 1) ∧ (𝐾 = 0 ∨ 𝐾 = 1)) → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼)))
911, 2, 90syl2an 595 . 2 ((𝐽 ∈ {0, 1} ∧ 𝐾 ∈ {0, 1}) → ((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼)))
9291impcom 408 1 (((𝑅𝑉𝐼 = if(𝐽 < 𝐾, 𝐽, 𝐾)) ∧ (𝐽 ∈ {0, 1} ∧ 𝐾 ∈ {0, 1})) → ((𝑅𝑟𝐽)↑𝑟𝐾) = (𝑅𝑟𝐼))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wo 842  w3a 1080   = wceq 1522  wcel 2081  Vcvv 3437  cun 3861  ifcif 4385  {cpr 4478   class class class wbr 4966   I cid 5352  dom cdm 5448  ran crn 5449  cres 5450  (class class class)co 7021  0cc0 10388  1c1 10389   < clt 10526  𝑟crelexp 14218
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5086  ax-sep 5099  ax-nul 5106  ax-pow 5162  ax-pr 5226  ax-un 7324  ax-cnex 10444  ax-resscn 10445  ax-1cn 10446  ax-icn 10447  ax-addcl 10448  ax-addrcl 10449  ax-mulcl 10450  ax-mulrcl 10451  ax-mulcom 10452  ax-addass 10453  ax-mulass 10454  ax-distr 10455  ax-i2m1 10456  ax-1ne0 10457  ax-1rid 10458  ax-rnegex 10459  ax-rrecex 10460  ax-cnre 10461  ax-pre-lttri 10462  ax-pre-lttrn 10463  ax-pre-ltadd 10464  ax-pre-mulgt0 10465
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-nel 3091  df-ral 3110  df-rex 3111  df-reu 3112  df-rab 3114  df-v 3439  df-sbc 3710  df-csb 3816  df-dif 3866  df-un 3868  df-in 3870  df-ss 3878  df-pss 3880  df-nul 4216  df-if 4386  df-pw 4459  df-sn 4477  df-pr 4479  df-tp 4481  df-op 4483  df-uni 4750  df-iun 4831  df-br 4967  df-opab 5029  df-mpt 5046  df-tr 5069  df-id 5353  df-eprel 5358  df-po 5367  df-so 5368  df-fr 5407  df-we 5409  df-xp 5454  df-rel 5455  df-cnv 5456  df-co 5457  df-dm 5458  df-rn 5459  df-res 5460  df-ima 5461  df-pred 6028  df-ord 6074  df-on 6075  df-lim 6076  df-suc 6077  df-iota 6194  df-fun 6232  df-fn 6233  df-f 6234  df-f1 6235  df-fo 6236  df-f1o 6237  df-fv 6238  df-riota 6982  df-ov 7024  df-oprab 7025  df-mpo 7026  df-om 7442  df-2nd 7551  df-wrecs 7803  df-recs 7865  df-rdg 7903  df-er 8144  df-en 8363  df-dom 8364  df-sdom 8365  df-pnf 10528  df-mnf 10529  df-xr 10530  df-ltxr 10531  df-le 10532  df-sub 10724  df-neg 10725  df-nn 11492  df-n0 11751  df-z 11835  df-uz 12099  df-seq 13225  df-relexp 14219
This theorem is referenced by:  relexp1idm  39570  relexp0idm  39571
  Copyright terms: Public domain W3C validator