| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ov2ssiunov2 | Structured version Visualization version GIF version | ||
| Description: Any particular operator value is the subset of the index union over a set of operator values. Generalized from rtrclreclem1 15130 and rtrclreclem2 . (Contributed by RP, 4-Jun-2020.) |
| Ref | Expression |
|---|---|
| ov2ssiunov2.def | ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) |
| Ref | Expression |
|---|---|
| ov2ssiunov2 | ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑅 ↑ 𝑀) ⊆ (𝐶‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1156 | . . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → 𝑀 ∈ 𝑁) | |
| 2 | simpr 490 | . . . . . 6 ⊢ (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → 𝑛 = 𝑀) | |
| 3 | 2 | oveq2d 7429 | . . . . 5 ⊢ (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → (𝑅 ↑ 𝑛) = (𝑅 ↑ 𝑀)) |
| 4 | 3 | eleq2d 2846 | . . . 4 ⊢ (((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) ∧ 𝑛 = 𝑀) → (𝑥 ∈ (𝑅 ↑ 𝑛) ↔ 𝑥 ∈ (𝑅 ↑ 𝑀))) |
| 5 | 1, 4 | rspcedv 3569 | . . 3 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑥 ∈ (𝑅 ↑ 𝑀) → ∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛))) |
| 6 | ov2ssiunov2.def | . . . . . 6 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟 ↑ 𝑛)) | |
| 7 | 6 | eliunov2 44519 | . . . . 5 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (𝑥 ∈ (𝐶‘𝑅) ↔ ∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛))) |
| 8 | 7 | biimprd 251 | . . . 4 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉) → (∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛) → 𝑥 ∈ (𝐶‘𝑅))) |
| 9 | 8 | 3adant3 1150 | . . 3 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (∃𝑛 ∈ 𝑁 𝑥 ∈ (𝑅 ↑ 𝑛) → 𝑥 ∈ (𝐶‘𝑅))) |
| 10 | 5, 9 | syld 48 | . 2 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑥 ∈ (𝑅 ↑ 𝑀) → 𝑥 ∈ (𝐶‘𝑅))) |
| 11 | 10 | ssrdv 3937 | 1 ⊢ ((𝑅 ∈ 𝑈 ∧ 𝑁 ∈ 𝑉 ∧ 𝑀 ∈ 𝑁) → (𝑅 ↑ 𝑀) ⊆ (𝐶‘𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 Vcvv 3450 ⊆ wss 3899 ∪ ciun 4951 ↦ cmpt 5186 ‘cfv 6533 (class class class)co 7413 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 |
| 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 2100 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-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 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-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6489 df-fun 6535 df-fv 6541 df-ov 7416 |
| This theorem is used by: dftrcl3 44560 dfrtrcl3 44573 |
| Copyright terms: Public domain | W3C validator |