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

Theorem relexpfld 14275
Description: The field of an exponentiation of a relation a subset of the relation's field. (Contributed by RP, 23-May-2020.)
Assertion
Ref Expression
relexpfld ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅)

Proof of Theorem relexpfld
StepHypRef Expression
1 simpl 475 . . . . . . . 8 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → 𝑁 = 1)
21oveq2d 6998 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = (𝑅𝑟1))
3 relexp1g 14252 . . . . . . . 8 (𝑅𝑉 → (𝑅𝑟1) = 𝑅)
43ad2antll 717 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟1) = 𝑅)
52, 4eqtrd 2816 . . . . . 6 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = 𝑅)
65unieqd 4727 . . . . 5 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = 𝑅)
76unieqd 4727 . . . 4 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = 𝑅)
8 eqimss 3915 . . . 4 ( (𝑅𝑟𝑁) = 𝑅 (𝑅𝑟𝑁) ⊆ 𝑅)
97, 8syl 17 . . 3 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) ⊆ 𝑅)
109ex 405 . 2 (𝑁 = 1 → ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅))
11 simp2 1118 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → 𝑁 ∈ ℕ0)
12 simp3 1119 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → 𝑅𝑉)
13 simp1 1117 . . . . . . . 8 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → ¬ 𝑁 = 1)
1413pm2.21d 119 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑁 = 1 → Rel 𝑅))
1511, 12, 143jca 1109 . . . . . 6 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑁 ∈ ℕ0𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)))
16 relexprelg 14264 . . . . . 6 ((𝑁 ∈ ℕ0𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁))
17 relfld 5969 . . . . . 6 (Rel (𝑅𝑟𝑁) → (𝑅𝑟𝑁) = (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)))
1815, 16, 173syl 18 . . . . 5 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) = (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)))
19 elnn0 11715 . . . . . . 7 (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
20 relexpnndm 14267 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) ⊆ dom 𝑅)
21 relexpnnrn 14271 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) ⊆ ran 𝑅)
22 unss12 4049 . . . . . . . . . 10 ((dom (𝑅𝑟𝑁) ⊆ dom 𝑅 ∧ ran (𝑅𝑟𝑁) ⊆ ran 𝑅) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
2320, 21, 22syl2anc 576 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑅𝑉) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
2423ex 405 . . . . . . . 8 (𝑁 ∈ ℕ → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
25 simpl 475 . . . . . . . . . . . . . . 15 ((𝑁 = 0 ∧ 𝑅𝑉) → 𝑁 = 0)
2625oveq2d 6998 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = (𝑅𝑟0))
27 relexp0g 14248 . . . . . . . . . . . . . . 15 (𝑅𝑉 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2827adantl 474 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2926, 28eqtrd 2816 . . . . . . . . . . . . 13 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
3029dmeqd 5628 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) = dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
31 dmresi 5768 . . . . . . . . . . . 12 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3230, 31syl6eq 2832 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
33 eqimss 3915 . . . . . . . . . . 11 (dom (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → dom (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3432, 33syl 17 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3529rneqd 5656 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) = ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
36 rnresi 5788 . . . . . . . . . . . 12 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3735, 36syl6eq 2832 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
38 eqimss 3915 . . . . . . . . . . 11 (ran (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → ran (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3937, 38syl 17 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
4034, 39unssd 4053 . . . . . . . . 9 ((𝑁 = 0 ∧ 𝑅𝑉) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
4140ex 405 . . . . . . . 8 (𝑁 = 0 → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
4224, 41jaoi 844 . . . . . . 7 ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
4319, 42sylbi 209 . . . . . 6 (𝑁 ∈ ℕ0 → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
4411, 12, 43sylc 65 . . . . 5 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
4518, 44eqsstrd 3897 . . . 4 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
46 dmrnssfld 5688 . . . 4 (dom 𝑅 ∪ ran 𝑅) ⊆ 𝑅
4745, 46syl6ss 3872 . . 3 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅)
48473expib 1103 . 2 𝑁 = 1 → ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅))
4910, 48pm2.61i 177 1 ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 387  wo 834  w3a 1069   = wceq 1508  wcel 2051  cun 3829  wss 3831   cuni 4717   I cid 5315  dom cdm 5411  ran crn 5412  cres 5413  Rel wrel 5416  (class class class)co 6982  0cc0 10341  1c1 10342  cn 11445  0cn0 11713  𝑟crelexp 14246
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1759  ax-4 1773  ax-5 1870  ax-6 1929  ax-7 1966  ax-8 2053  ax-9 2060  ax-10 2080  ax-11 2094  ax-12 2107  ax-13 2302  ax-ext 2752  ax-sep 5064  ax-nul 5071  ax-pow 5123  ax-pr 5190  ax-un 7285  ax-cnex 10397  ax-resscn 10398  ax-1cn 10399  ax-icn 10400  ax-addcl 10401  ax-addrcl 10402  ax-mulcl 10403  ax-mulrcl 10404  ax-mulcom 10405  ax-addass 10406  ax-mulass 10407  ax-distr 10408  ax-i2m1 10409  ax-1ne0 10410  ax-1rid 10411  ax-rnegex 10412  ax-rrecex 10413  ax-cnre 10414  ax-pre-lttri 10415  ax-pre-lttrn 10416  ax-pre-ltadd 10417  ax-pre-mulgt0 10418
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 835  df-3or 1070  df-3an 1071  df-tru 1511  df-ex 1744  df-nf 1748  df-sb 2017  df-mo 2551  df-eu 2589  df-clab 2761  df-cleq 2773  df-clel 2848  df-nfc 2920  df-ne 2970  df-nel 3076  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3419  df-sbc 3684  df-csb 3789  df-dif 3834  df-un 3836  df-in 3838  df-ss 3845  df-pss 3847  df-nul 4182  df-if 4354  df-pw 4427  df-sn 4445  df-pr 4447  df-tp 4449  df-op 4451  df-uni 4718  df-iun 4799  df-br 4935  df-opab 4997  df-mpt 5014  df-tr 5036  df-id 5316  df-eprel 5321  df-po 5330  df-so 5331  df-fr 5370  df-we 5372  df-xp 5417  df-rel 5418  df-cnv 5419  df-co 5420  df-dm 5421  df-rn 5422  df-res 5423  df-ima 5424  df-pred 5991  df-ord 6037  df-on 6038  df-lim 6039  df-suc 6040  df-iota 6157  df-fun 6195  df-fn 6196  df-f 6197  df-f1 6198  df-fo 6199  df-f1o 6200  df-fv 6201  df-riota 6943  df-ov 6985  df-oprab 6986  df-mpo 6987  df-om 7403  df-2nd 7508  df-wrecs 7756  df-recs 7818  df-rdg 7856  df-er 8095  df-en 8313  df-dom 8314  df-sdom 8315  df-pnf 10482  df-mnf 10483  df-xr 10484  df-ltxr 10485  df-le 10486  df-sub 10678  df-neg 10679  df-nn 11446  df-n0 11714  df-z 11800  df-uz 12065  df-seq 13191  df-relexp 14247
This theorem is referenced by:  relexpfldd  14276
  Copyright terms: Public domain W3C validator