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

Theorem relexpfld 15074
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 487 . . . . . . . 8 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → 𝑁 = 1)
21oveq2d 7416 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = (𝑅𝑟1))
3 relexp1g 15051 . . . . . . . 8 (𝑅𝑉 → (𝑅𝑟1) = 𝑅)
43ad2antll 741 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟1) = 𝑅)
52, 4eqtrd 2800 . . . . . 6 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = 𝑅)
65unieqd 4880 . . . . 5 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = 𝑅)
76unieqd 4880 . . . 4 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) = 𝑅)
8 eqimss 3997 . . . 4 ( (𝑅𝑟𝑁) = 𝑅 (𝑅𝑟𝑁) ⊆ 𝑅)
97, 8syl 18 . . 3 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0𝑅𝑉)) → (𝑅𝑟𝑁) ⊆ 𝑅)
109ex 417 . 2 (𝑁 = 1 → ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅))
11 simp2 1153 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → 𝑁 ∈ ℕ0)
12 simp3 1154 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → 𝑅𝑉)
13 simp1 1152 . . . . . . . 8 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → ¬ 𝑁 = 1)
1413pm2.21d 122 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑁 = 1 → Rel 𝑅))
1511, 12, 143jca 1144 . . . . . 6 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑁 ∈ ℕ0𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)))
16 relexprelg 15063 . . . . . 6 ((𝑁 ∈ ℕ0𝑅𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅𝑟𝑁))
17 relfld 6265 . . . . . 6 (Rel (𝑅𝑟𝑁) → (𝑅𝑟𝑁) = (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)))
1815, 16, 173syl 19 . . . . 5 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) = (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)))
19 elnn0 12494 . . . . . . 7 (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
20 relexpnndm 15066 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) ⊆ dom 𝑅)
21 relexpnnrn 15070 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) ⊆ ran 𝑅)
22 unss12 4143 . . . . . . . . . 10 ((dom (𝑅𝑟𝑁) ⊆ dom 𝑅 ∧ ran (𝑅𝑟𝑁) ⊆ ran 𝑅) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
2320, 21, 22syl2anc 595 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑅𝑉) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
2423ex 417 . . . . . . . 8 (𝑁 ∈ ℕ → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
25 simpl 487 . . . . . . . . . . . . . . 15 ((𝑁 = 0 ∧ 𝑅𝑉) → 𝑁 = 0)
2625oveq2d 7416 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = (𝑅𝑟0))
27 relexp0g 15047 . . . . . . . . . . . . . . 15 (𝑅𝑉 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2827adantl 486 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2926, 28eqtrd 2800 . . . . . . . . . . . . 13 ((𝑁 = 0 ∧ 𝑅𝑉) → (𝑅𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
3029dmeqd 5885 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) = dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
31 dmresi 6044 . . . . . . . . . . . 12 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3230, 31eqtrdi 2816 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
33 eqimss 3997 . . . . . . . . . . 11 (dom (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → dom (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3432, 33syl 18 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅𝑉) → dom (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3529rneqd 5918 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) = ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
36 rnresi 6067 . . . . . . . . . . . 12 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3735, 36eqtrdi 2816 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
38 eqimss 3997 . . . . . . . . . . 11 (ran (𝑅𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → ran (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3937, 38syl 18 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅𝑉) → ran (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
4034, 39unssd 4147 . . . . . . . . 9 ((𝑁 = 0 ∧ 𝑅𝑉) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
4140ex 417 . . . . . . . 8 (𝑁 = 0 → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
4224, 41jaoi 870 . . . . . . 7 ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
4319, 42sylbi 220 . . . . . 6 (𝑁 ∈ ℕ0 → (𝑅𝑉 → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
4411, 12, 43sylc 66 . . . . 5 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (dom (𝑅𝑟𝑁) ∪ ran (𝑅𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
4518, 44eqsstrd 3973 . . . 4 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
46 dmrnssfld 5954 . . . 4 (dom 𝑅 ∪ ran 𝑅) ⊆ 𝑅
4745, 46sstrdi 3951 . . 3 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅)
48473expib 1138 . 2 𝑁 = 1 → ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅))
4910, 48pm2.61i 184 1 ((𝑁 ∈ ℕ0𝑅𝑉) → (𝑅𝑟𝑁) ⊆ 𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wo 860  w3a 1101   = wceq 1563  wcel 2145  cun 3905  wss 3907   cuni 4867   I cid 5545  dom cdm 5651  ran crn 5652  cres 5653  Rel wrel 5656  (class class class)co 7400  0cc0 11088  1c1 11089  cn 12221  0cn0 12492  𝑟crelexp 15044
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6291  df-ord 6352  df-on 6353  df-lim 6354  df-suc 6355  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-er 8682  df-en 8932  df-dom 8933  df-sdom 8934  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-nn 12222  df-n0 12493  df-z 12580  df-uz 12851  df-seq 14026  df-relexp 15045
This theorem is referenced by:  relexpfldd  15075
  Copyright terms: Public domain W3C validator