| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fvmptiunrelexplb0d | Structured version Visualization version GIF version | ||
| Description: If the indexed union ranges over the zeroth power of the relation, then a restriction of the identity relation is a subset of the appliction of the function to the relation. (Contributed by RP, 22-Jul-2020.) |
| Ref | Expression |
|---|---|
| fvmptiunrelexplb0d.c | ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) |
| fvmptiunrelexplb0d.r | ⊢ (𝜑 → 𝑅 ∈ V) |
| fvmptiunrelexplb0d.n | ⊢ (𝜑 → 𝑁 ∈ V) |
| fvmptiunrelexplb0d.0 | ⊢ (𝜑 → 0 ∈ 𝑁) |
| Ref | Expression |
|---|---|
| fvmptiunrelexplb0d | ⊢ (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvmptiunrelexplb0d.0 | . . 3 ⊢ (𝜑 → 0 ∈ 𝑁) | |
| 2 | oveq2 7354 | . . . 4 ⊢ (𝑛 = 0 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟0)) | |
| 3 | 2 | ssiun2s 4995 | . . 3 ⊢ (0 ∈ 𝑁 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 4 | 1, 3 | syl 17 | . 2 ⊢ (𝜑 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 5 | fvmptiunrelexplb0d.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ V) | |
| 6 | relexp0g 14929 | . . 3 ⊢ (𝑅 ∈ V → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) | |
| 7 | 5, 6 | syl 17 | . 2 ⊢ (𝜑 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) |
| 8 | fvmptiunrelexplb0d.c | . . . 4 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) | |
| 9 | oveq1 7353 | . . . . 5 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
| 10 | 9 | iuneq2d 4970 | . . . 4 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 11 | fvmptiunrelexplb0d.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ V) | |
| 12 | ovex 7379 | . . . . . 6 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
| 13 | 12 | rgenw 3051 | . . . . 5 ⊢ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V |
| 14 | iunexg 7895 | . . . . 5 ⊢ ((𝑁 ∈ V ∧ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) | |
| 15 | 11, 13, 14 | sylancl 586 | . . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) |
| 16 | 8, 10, 5, 15 | fvmptd3 6952 | . . 3 ⊢ (𝜑 → (𝐶‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 17 | 16 | eqcomd 2737 | . 2 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) = (𝐶‘𝑅)) |
| 18 | 4, 7, 17 | 3sstr3d 3984 | 1 ⊢ (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 ∀wral 3047 Vcvv 3436 ∪ cun 3895 ⊆ wss 3897 ∪ ciun 4939 ↦ cmpt 5170 I cid 5508 dom cdm 5614 ran crn 5615 ↾ cres 5616 ‘cfv 6481 (class class class)co 7346 0cc0 11006 ↑𝑟crelexp 14926 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-mulcl 11068 ax-i2m1 11074 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3737 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-iota 6437 df-fun 6483 df-fv 6489 df-ov 7349 df-oprab 7350 df-mpo 7351 df-n0 12382 df-relexp 14927 |
| This theorem is referenced by: fvmptiunrelexplb0da 43777 fvrcllb0d 43785 fvrtrcllb0d 43827 |
| Copyright terms: Public domain | W3C validator |