| 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 7420 | . . . 4 ⊢ (𝑛 = 0 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟0)) | |
| 3 | 2 | ssiun2s 5012 | . . 3 ⊢ (0 ∈ 𝑁 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 4 | 1, 3 | syl 18 | . 2 ⊢ (𝜑 → (𝑅↑𝑟0) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 5 | fvmptiunrelexplb0d.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ V) | |
| 6 | relexp0g 15066 | . . 3 ⊢ (𝑅 ∈ V → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) | |
| 7 | 5, 6 | syl 18 | . 2 ⊢ (𝜑 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) |
| 8 | fvmptiunrelexplb0d.c | . . . 4 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) | |
| 9 | oveq1 7419 | . . . . 5 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
| 10 | 9 | iuneq2d 4986 | . . . 4 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 11 | fvmptiunrelexplb0d.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ V) | |
| 12 | ovex 7445 | . . . . . 6 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
| 13 | 12 | rgenw 3082 | . . . . 5 ⊢ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V |
| 14 | iunexg 7958 | . . . . 5 ⊢ ((𝑁 ∈ V ∧ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) | |
| 15 | 11, 13, 14 | sylancl 597 | . . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) |
| 16 | 8, 10, 5, 15 | fvmptd3 7013 | . . 3 ⊢ (𝜑 → (𝐶‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 17 | 16 | eqcomd 2768 | . 2 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) = (𝐶‘𝑅)) |
| 18 | 4, 7, 17 | 3sstr3d 3990 | 1 ⊢ (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 ∀wral 3078 Vcvv 3454 ∪ cun 3902 ⊆ wss 3904 ∪ ciun 4955 ↦ cmpt 5191 I cid 5554 dom cdm 5660 ran crn 5661 ↾ cres 5662 ‘cfv 6536 (class class class)co 7412 0cc0 11106 ↑𝑟crelexp 15063 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-mulcl 11168 ax-i2m1 11174 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-sbc 3744 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7415 df-oprab 7416 df-mpo 7417 df-n0 12511 df-relexp 15064 |
| This theorem is used by: fvmptiunrelexplb0da 44439 fvrcllb0d 44447 fvrtrcllb0d 44489 |
| Copyright terms: Public domain | W3C validator |