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

Theorem relexpfld 15245
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 7467 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → (𝑅↑𝑟𝑁) = (𝑅↑𝑟1))
3 relexp1g 15222 . . . . . . . 8 (𝑅 ∈ 𝑉 → (𝑅↑𝑟1) = 𝑅)
43ad2antll 742 . . . . . . 7 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → (𝑅↑𝑟1) = 𝑅)
52, 4eqtrd 2798 . . . . . 6 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → (𝑅↑𝑟𝑁) = 𝑅)
65unieqd 4885 . . . . 5 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → ∪ (𝑅↑𝑟𝑁) = ∪ 𝑅)
76unieqd 4885 . . . 4 ((𝑁 = 1 ∧ (𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉)) → ∪ ∪ (𝑅↑𝑟𝑁) = ∪ ∪ 𝑅)
8 eqimss 3971 . . . 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 15234 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ (𝑁 = 1 → Rel 𝑅)) → Rel (𝑅↑𝑟𝑁))
17 relfld 6301 . . . . . 6 (Rel (𝑅↑𝑟𝑁) → ∪ ∪ (𝑅↑𝑟𝑁) = (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)))
1815, 16, 173syl 19 . . . . 5 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) = (dom (𝑅↑𝑟𝑁) ∪ ran (𝑅↑𝑟𝑁)))
19 elnn0 12648 . . . . . . 7 (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
20 relexpnndm 15237 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) ⊆ dom 𝑅)
21 relexpnnrn 15241 . . . . . . . . . 10 ((𝑁 ∈ ℕ ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) ⊆ ran 𝑅)
22 unss12 4189 . . . . . . . . . 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 7467 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = (𝑅↑𝑟0))
27 relexp0g 15218 . . . . . . . . . . . . . . 15 (𝑅 ∈ 𝑉 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2827adantl 487 . . . . . . . . . . . . . 14 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
2926, 28eqtrd 2798 . . . . . . . . . . . . 13 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → (𝑅↑𝑟𝑁) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
3029dmeqd 5899 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) = dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
31 dmresi 6062 . . . . . . . . . . . 12 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3230, 31eqtrdi 2814 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
33 eqimss 3971 . . . . . . . . . . 11 (dom (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → dom (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3432, 33syl 18 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → dom (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3529rneqd 5932 . . . . . . . . . . . 12 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) = ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
36 rnresi 6091 . . . . . . . . . . . 12 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
3735, 36eqtrdi 2814 . . . . . . . . . . 11 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅))
38 eqimss 3971 . . . . . . . . . . 11 (ran (𝑅↑𝑟𝑁) = (dom 𝑅 ∪ ran 𝑅) → ran (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
3937, 38syl 18 . . . . . . . . . 10 ((𝑁 = 0 ∧ 𝑅 ∈ 𝑉) → ran (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
4034, 39unssd 4193 . . . . . . . . 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 3947 . . . 4 ((¬ 𝑁 = 1 ∧ 𝑁 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉) → ∪ ∪ (𝑅↑𝑟𝑁) ⊆ (dom 𝑅 ∪ ran 𝑅))
46 dmrnssfld 5968 . . . 4 (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅
4745, 46sstrdi 3925 . . 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 2147   ⊆ wss 3900   ∪ cun 4152  ∪ cuni 4872   I cid 5552  dom cdm 5658  ran crn 5659   ↾ cres 5660  Rel wrel 5663  (class class class)co 7451  0cc0 11239  1c1 11240  ℕcn 12375  ℕ0cn0 12646  ↑𝑟crelexp 15215
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-n0 12647  df-z 12734  df-uz 13006  df-seq 14185  df-relexp 15216
This theorem is used by:  relexpfldd  15246
  Copyright terms: Public domain W3C validator