Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ov2ssiunov2 Structured version   Visualization version   GIF version

Theorem ov2ssiunov2 44807
Description: Any particular operator value is the subset of the index union over a set of operator values. Generalized from rtrclreclem1 15217 and rtrclreclem2 . (Contributed by RP, 4-Jun-2020.)
Hypothesis
Ref Expression
ov2ssiunov2.def 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))
Assertion
Ref Expression
ov2ssiunov2 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑅 ↑ 𝑀) ⊆ (𝐶‘𝑅))
Distinct variable groups:   𝑛,𝑟,𝐶,𝑁, ↑   𝑛,𝑀   𝑅,𝑟,𝑛   𝑈,𝑛   𝑛,𝑉
Allowed substitution hints:   𝑈(𝑟)   𝑀(𝑟)   𝑉(𝑟)

Proof of Theorem ov2ssiunov2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 simp3 1156 . . . 4 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → 𝑀 ∈ 𝑁)
2 simpr 490 . . . . . 6 (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → 𝑛 = 𝑀)
32oveq2d 7438 . . . . 5 (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → (𝑅 ↑ 𝑛) = (𝑅 ↑ 𝑀))
43eleq2d 2846 . . . 4 (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → (𝑥 ∈ (𝑅 ↑ 𝑛) ↔ 𝑥 ∈ (𝑅 ↑ 𝑀)))
51, 4rspcedv 3569 . . 3 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑥 ∈ (𝑅 ↑ 𝑀) → ∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛)))
6 ov2ssiunov2.def . . . . . 6 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))
76eliunov2 44786 . . . . 5 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑥 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛)))
87biimprd 251 . . . 4 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛) → 𝑥 ∈ (𝐶‘𝑅)))
983adant3 1150 . . 3 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛) → 𝑥 ∈ (𝐶‘𝑅)))
105, 9syld 48 . 2 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑥 ∈ (𝑅 ↑ 𝑀) → 𝑥 ∈ (𝐶‘𝑅)))
1110ssrdv 3915 1 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑅 ↑ 𝑀) ⊆ (𝐶‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450   ⊆ wss 3896  ∪ ciun 4950   ↦ cmpt 5185  ‘cfv 6541  (class class class)co 7422
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7753
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6496  df-fun 6543  df-fv 6549  df-ov 7425
This theorem is used by:  dftrcl3  44827  dfrtrcl3  44840
  Copyright terms: Public domain W3C validator