| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fvmptiunrelexplb0da | 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 |
|---|---|
| fvmptiunrelexplb0da.c | ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) |
| fvmptiunrelexplb0da.r | ⊢ (𝜑 → 𝑅 ∈ V) |
| fvmptiunrelexplb0da.n | ⊢ (𝜑 → 𝑁 ∈ V) |
| fvmptiunrelexplb0da.rel | ⊢ (𝜑 → Rel 𝑅) |
| fvmptiunrelexplb0da.0 | ⊢ (𝜑 → 0 ∈ 𝑁) |
| Ref | Expression |
|---|---|
| fvmptiunrelexplb0da | ⊢ (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (𝐶‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvmptiunrelexplb0da.rel | . . . 4 ⊢ (𝜑 → Rel 𝑅) | |
| 2 | relfld 6276 | . . . 4 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) | |
| 3 | 1, 2 | syl 18 | . . 3 ⊢ (𝜑 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) |
| 4 | 3 | reseq2d 5977 | . 2 ⊢ (𝜑 → ( I ↾ ∪ ∪ 𝑅) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) |
| 5 | fvmptiunrelexplb0da.c | . . 3 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) | |
| 6 | fvmptiunrelexplb0da.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ V) | |
| 7 | fvmptiunrelexplb0da.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ V) | |
| 8 | fvmptiunrelexplb0da.0 | . . 3 ⊢ (𝜑 → 0 ∈ 𝑁) | |
| 9 | 5, 6, 7, 8 | fvmptiunrelexplb0d 44438 | . 2 ⊢ (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅)) |
| 10 | 4, 9 | eqsstrd 3970 | 1 ⊢ (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (𝐶‘𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 Vcvv 3454 ∪ cun 3902 ⊆ wss 3904 ∪ cuni 4871 ∪ ciun 4955 ↦ cmpt 5191 I cid 5554 dom cdm 5660 ran crn 5661 ↾ cres 5662 Rel wrel 5665 ‘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: fvrcllb0da 44448 fvrtrcllb0da 44490 |
| Copyright terms: Public domain | W3C validator |