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 44961
Description: Any particular operator value is the subset of the index union over a set of operator values. Generalized from rtrclreclem1 15253 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 7467 . . . . 5 (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → (𝑅 ↑ 𝑛) = (𝑅 ↑ 𝑀))
43eleq2d 2850 . . . 4 (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → (𝑥 ∈ (𝑅 ↑ 𝑛) ↔ 𝑥 ∈ (𝑅 ↑ 𝑀)))
51, 4rspcedv 3573 . . 3 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑥 ∈ (𝑅 ↑ 𝑀) → ∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛)))
6 ov2ssiunov2.def . . . . . 6 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛))
76eliunov2 44940 . . . . 5 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑥 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛)))
87biimprd 251 . . . 4 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛) → 𝑥 ∈ (𝐶‘𝑅)))
983adant3 1150 . . 3 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛) → 𝑥 ∈ (𝐶‘𝑅)))
105, 9syld 48 . 2 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑥 ∈ (𝑅 ↑ 𝑀) → 𝑥 ∈ (𝐶‘𝑅)))
1110ssrdv 3919 1 ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑅 ↑ 𝑀) ⊆ (𝐶‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  ∪ ciun 4956   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451
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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  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-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454
This theorem is used by:  dftrcl3  44981  dfrtrcl3  44994
  Copyright terms: Public domain W3C validator