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

Theorem relexpfld 15195
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 488 . . . . . . . 8 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → 𝑁 = 1)
21oveq2d 7434 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → (𝑅↑𝑟𝑁) = (𝑅↑𝑟1))
3 relexp1g 15172 . . . . . . . 8 (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅)
43ad2antll 742 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → (𝑅↑𝑟1) = 𝑅)
52, 4eqtrd 2796 . . . . . 6 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → (𝑅↑𝑟𝑁) = 𝑅)
65unieqd 4880 . . . . 5 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → ∪ (𝑅↑𝑟𝑁) = ∪ 𝑅)
76unieqd 4880 . . . 4 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → ∪ ∪ (𝑅↑𝑟𝑁) = ∪ ∪ 𝑅)
8 eqimss 3989 . . . 4 (∪ ∪ (𝑅↑𝑟𝑁) = ∪ ∪ 𝑅 → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ ∪ ∪ 𝑅)
97, 8syl 18 . . 3 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ ∪ ∪ 𝑅)
109ex 418 . 2 (𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ ∪ ∪ 𝑅))
11 simp2 1155 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → 𝑁 ∈ ℕ0)
12 simp3 1156 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉)
13 simp1 1154 . . . . . . . 8 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ¬ 𝑁 = 1)
1413pm2.21d 122 . . . . . . 7 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → (𝑁 = 1 → Rel 𝑅))
1511, 12, 143jca 1146 . . . . . 6 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ (𝑁 = 1 → Rel 𝑅)))
16 relexprelg 15184 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅↑𝑟𝑁))
17 relfld 6276 . . . . . 6 (Rel (𝑅↑𝑟𝑁) → ∪ ∪ (𝑅↑𝑟𝑁) = (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)))
1815, 16, 173syl 19 . . . . 5 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) = (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)))
19 elnn0 12601 . . . . . . 7 (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
20 relexpnndm 15187 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅)
21 relexpnnrn 15191 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) ⊆ ran 𝑅)
22 unss12 4134 . . . . . . . . . 10 ((dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅 ∧ ran (𝑅↑𝑟𝑁) ⊆ ran 𝑅) → (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
2320, 21, 22syl2anc 596 . . . . . . . . 9 ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
2423ex 418 . . . . . . . 8 (𝑁 ∈ ℕ → (𝑅 ∈ 𝑉 → (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
25 simpl 488 . . . . . . . . . . . . . . 15 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → 𝑁 = 0)
2625oveq2d 7434 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = (𝑅↑𝑟0))
27 relexp0g 15168 . . . . . . . . . . . . . . 15 (𝑅 ∈ 𝑉 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2827adantl 487 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2926, 28eqtrd 2796 . . . . . . . . . . . . 13 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
3029dmeqd 5887 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) = dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
31 dmresi 6044 . . . . . . . . . . . 12 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3230, 31eqtrdi 2812 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
33 eqimss 3989 . . . . . . . . . . 11 (dom (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → dom (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3432, 33syl 18 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3529rneqd 5920 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) = ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
36 rnresi 6073 . . . . . . . . . . . 12 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3735, 36eqtrdi 2812 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
38 eqimss 3989 . . . . . . . . . . 11 (ran (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → ran (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3937, 38syl 18 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
4034, 39unssd 4138 . . . . . . . . 9 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅))
4140ex 418 . . . . . . . 8 (𝑁 = 0 → (𝑅 ∈ 𝑉 → (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)) ⊆ (dom 𝑅 ∪ ran 𝑅)))
4224, 41jaoi 871 . . . . . . 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 3965 . . . 4 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
46 dmrnssfld 5956 . . . 4 (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅
4745, 46sstrdi 3943 . . 3 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ ∪ ∪ 𝑅)
48473expib 1140 . 2 (¬ 𝑁 = 1 → ((𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ ∪ ∪ 𝑅))
4910, 48pm2.61i 184 1 ((𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ ∪ ∪ 𝑅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ∪ cun 3897   ⊆ wss 3899  ∪ cuni 4867   I cid 5545  dom cdm 5651  ran crn 5652   ↾ cres 5653  Rel wrel 5656  (class class class)co 7418  0cc0 11193  1c1 11194  ℕcn 12328  ℕ0cn0 12599  ↑𝑟crelexp 15165
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  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 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-n0 12600  df-z 12687  df-uz 12959  df-seq 14138  df-relexp 15166
This theorem is used by:  relexpfldd  15196
  Copyright terms: Public domain W3C validator