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

Theorem relexprelg 14942
Description: The exponentiation of a class is a relation except when the exponent is one and the class is not a relation. (Contributed by RP, 23-May-2020.)
Assertion
Ref Expression
relexprelg ((𝑁 ∈ ℕ0𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁))

Proof of Theorem relexprelg
Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elnn0 12380 . . 3 (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2 eqeq1 2735 . . . . . . . 8 (𝑛 = 1 → (𝑛 = 1 ↔ 1 = 1))
32imbi1d 341 . . . . . . 7 (𝑛 = 1 → ((𝑛 = 1 → Rel 𝑅) ↔ (1 = 1 → Rel 𝑅)))
43anbi2d 630 . . . . . 6 (𝑛 = 1 → ((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) ↔ (𝑅𝑉 ∧ (1 = 1 → Rel 𝑅))))
5 oveq2 7354 . . . . . . 7 (𝑛 = 1 → (𝑅𝑟𝑛) = (𝑅𝑟1))
65releqd 5719 . . . . . 6 (𝑛 = 1 → (Rel (𝑅𝑟𝑛) ↔ Rel (𝑅𝑟1)))
74, 6imbi12d 344 . . . . 5 (𝑛 = 1 → (((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑛)) ↔ ((𝑅𝑉 ∧ (1 = 1 → Rel 𝑅)) → Rel (𝑅𝑟1))))
8 eqeq1 2735 . . . . . . . 8 (𝑛 = 𝑚 → (𝑛 = 1 ↔ 𝑚 = 1))
98imbi1d 341 . . . . . . 7 (𝑛 = 𝑚 → ((𝑛 = 1 → Rel 𝑅) ↔ (𝑚 = 1 → Rel 𝑅)))
109anbi2d 630 . . . . . 6 (𝑛 = 𝑚 → ((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) ↔ (𝑅𝑉 ∧ (𝑚 = 1 → Rel 𝑅))))
11 oveq2 7354 . . . . . . 7 (𝑛 = 𝑚 → (𝑅𝑟𝑛) = (𝑅𝑟𝑚))
1211releqd 5719 . . . . . 6 (𝑛 = 𝑚 → (Rel (𝑅𝑟𝑛) ↔ Rel (𝑅𝑟𝑚)))
1310, 12imbi12d 344 . . . . 5 (𝑛 = 𝑚 → (((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑛)) ↔ ((𝑅𝑉 ∧ (𝑚 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑚))))
14 eqeq1 2735 . . . . . . . 8 (𝑛 = (𝑚 + 1) → (𝑛 = 1 ↔ (𝑚 + 1) = 1))
1514imbi1d 341 . . . . . . 7 (𝑛 = (𝑚 + 1) → ((𝑛 = 1 → Rel 𝑅) ↔ ((𝑚 + 1) = 1 → Rel 𝑅)))
1615anbi2d 630 . . . . . 6 (𝑛 = (𝑚 + 1) → ((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) ↔ (𝑅𝑉 ∧ ((𝑚 + 1) = 1 → Rel 𝑅))))
17 oveq2 7354 . . . . . . 7 (𝑛 = (𝑚 + 1) → (𝑅𝑟𝑛) = (𝑅𝑟(𝑚 + 1)))
1817releqd 5719 . . . . . 6 (𝑛 = (𝑚 + 1) → (Rel (𝑅𝑟𝑛) ↔ Rel (𝑅𝑟(𝑚 + 1))))
1916, 18imbi12d 344 . . . . 5 (𝑛 = (𝑚 + 1) → (((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑛)) ↔ ((𝑅𝑉 ∧ ((𝑚 + 1) = 1 → Rel 𝑅)) → Rel (𝑅𝑟(𝑚 + 1)))))
20 eqeq1 2735 . . . . . . . 8 (𝑛 = 𝑁 → (𝑛 = 1 ↔ 𝑁 = 1))
2120imbi1d 341 . . . . . . 7 (𝑛 = 𝑁 → ((𝑛 = 1 → Rel 𝑅) ↔ (𝑁 = 1 → Rel 𝑅)))
2221anbi2d 630 . . . . . 6 (𝑛 = 𝑁 → ((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) ↔ (𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅))))
23 oveq2 7354 . . . . . . 7 (𝑛 = 𝑁 → (𝑅𝑟𝑛) = (𝑅𝑟𝑁))
2423releqd 5719 . . . . . 6 (𝑛 = 𝑁 → (Rel (𝑅𝑟𝑛) ↔ Rel (𝑅𝑟𝑁)))
2522, 24imbi12d 344 . . . . 5 (𝑛 = 𝑁 → (((𝑅𝑉 ∧ (𝑛 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑛)) ↔ ((𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁))))
26 eqid 2731 . . . . . . . 8 1 = 1
27 pm2.27 42 . . . . . . . 8 (1 = 1 → ((1 = 1 → Rel 𝑅) → Rel 𝑅))
2826, 27ax-mp 5 . . . . . . 7 ((1 = 1 → Rel 𝑅) → Rel 𝑅)
2928adantl 481 . . . . . 6 ((𝑅𝑉 ∧ (1 = 1 → Rel 𝑅)) → Rel 𝑅)
30 relexp1g 14930 . . . . . . . 8 (𝑅𝑉 → (𝑅𝑟1) = 𝑅)
3130adantr 480 . . . . . . 7 ((𝑅𝑉 ∧ (1 = 1 → Rel 𝑅)) → (𝑅𝑟1) = 𝑅)
3231releqd 5719 . . . . . 6 ((𝑅𝑉 ∧ (1 = 1 → Rel 𝑅)) → (Rel (𝑅𝑟1) ↔ Rel 𝑅))
3329, 32mpbird 257 . . . . 5 ((𝑅𝑉 ∧ (1 = 1 → Rel 𝑅)) → Rel (𝑅𝑟1))
34 relco 6057 . . . . . . . . 9 Rel ((𝑅𝑟𝑚) ∘ 𝑅)
35 relexpsucnnr 14929 . . . . . . . . . . 11 ((𝑅𝑉𝑚 ∈ ℕ) → (𝑅𝑟(𝑚 + 1)) = ((𝑅𝑟𝑚) ∘ 𝑅))
3635ancoms 458 . . . . . . . . . 10 ((𝑚 ∈ ℕ ∧ 𝑅𝑉) → (𝑅𝑟(𝑚 + 1)) = ((𝑅𝑟𝑚) ∘ 𝑅))
3736releqd 5719 . . . . . . . . 9 ((𝑚 ∈ ℕ ∧ 𝑅𝑉) → (Rel (𝑅𝑟(𝑚 + 1)) ↔ Rel ((𝑅𝑟𝑚) ∘ 𝑅)))
3834, 37mpbiri 258 . . . . . . . 8 ((𝑚 ∈ ℕ ∧ 𝑅𝑉) → Rel (𝑅𝑟(𝑚 + 1)))
3938a1d 25 . . . . . . 7 ((𝑚 ∈ ℕ ∧ 𝑅𝑉) → (((𝑚 + 1) = 1 → Rel 𝑅) → Rel (𝑅𝑟(𝑚 + 1))))
4039expimpd 453 . . . . . 6 (𝑚 ∈ ℕ → ((𝑅𝑉 ∧ ((𝑚 + 1) = 1 → Rel 𝑅)) → Rel (𝑅𝑟(𝑚 + 1))))
4140a1d 25 . . . . 5 (𝑚 ∈ ℕ → (((𝑅𝑉 ∧ (𝑚 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑚)) → ((𝑅𝑉 ∧ ((𝑚 + 1) = 1 → Rel 𝑅)) → Rel (𝑅𝑟(𝑚 + 1)))))
427, 13, 19, 25, 33, 41nnind 12140 . . . 4 (𝑁 ∈ ℕ → ((𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁)))
43 relexp0rel 14941 . . . . . . . 8 (𝑅𝑉 → Rel (𝑅𝑟0))
4443adantl 481 . . . . . . 7 ((𝑁 = 0 ∧ 𝑅𝑉) → Rel (𝑅𝑟0))
45 simpl 482 . . . . . . . . 9 ((𝑁 = 0 ∧ 𝑅𝑉) → 𝑁 = 0)
4645oveq2d 7362 . . . . . . . 8 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = (𝑅𝑟0))
4746releqd 5719 . . . . . . 7 ((𝑁 = 0 ∧ 𝑅𝑉) → (Rel (𝑅𝑟𝑁) ↔ Rel (𝑅𝑟0)))
4844, 47mpbird 257 . . . . . 6 ((𝑁 = 0 ∧ 𝑅𝑉) → Rel (𝑅𝑟𝑁))
4948a1d 25 . . . . 5 ((𝑁 = 0 ∧ 𝑅𝑉) → ((𝑁 = 1 → Rel 𝑅) → Rel (𝑅𝑟𝑁)))
5049expimpd 453 . . . 4 (𝑁 = 0 → ((𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁)))
5142, 50jaoi 857 . . 3 ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → ((𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁)))
521, 51sylbi 217 . 2 (𝑁 ∈ ℕ0 → ((𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁)))
53523impib 1116 1 ((𝑁 ∈ ℕ0𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 847  w3a 1086   = wceq 1541  wcel 2111  ccom 5620  Rel wrel 5621  (class class class)co 7346  0cc0 11003  1c1 11004   + caddc 11006  cn 12122  0cn0 12378  𝑟crelexp 14923
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-cnex 11059  ax-resscn 11060  ax-1cn 11061  ax-icn 11062  ax-addcl 11063  ax-addrcl 11064  ax-mulcl 11065  ax-mulrcl 11066  ax-mulcom 11067  ax-addass 11068  ax-mulass 11069  ax-distr 11070  ax-i2m1 11071  ax-1ne0 11072  ax-1rid 11073  ax-rnegex 11074  ax-rrecex 11075  ax-cnre 11076  ax-pre-lttri 11077  ax-pre-lttrn 11078  ax-pre-ltadd 11079  ax-pre-mulgt0 11080
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-er 8622  df-en 8870  df-dom 8871  df-sdom 8872  df-pnf 11145  df-mnf 11146  df-xr 11147  df-ltxr 11148  df-le 11149  df-sub 11343  df-neg 11344  df-nn 12123  df-n0 12379  df-z 12466  df-uz 12730  df-seq 13906  df-relexp 14924
This theorem is referenced by:  relexprel  14943  relexpfld  14953  relexpuzrel  14956
  Copyright terms: Public domain W3C validator