| 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 6266 | . . . 4 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) | |
| 3 | 1, 2 | syl 18 | . . 3 ⊢ (𝜑 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) |
| 4 | 3 | reseq2d 5966 | . 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 44628 | . 2 ⊢ (𝜑 → ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ⊆ (𝐶‘𝑅)) |
| 10 | 4, 9 | eqsstrd 3964 | 1 ⊢ (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (𝐶‘𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∪ cun 3896 ⊆ wss 3898 ∪ cuni 4866 ∪ ciun 4950 ↦ cmpt 5185 I cid 5541 dom cdm 5647 ran crn 5648 ↾ cres 5649 Rel wrel 5652 ‘cfv 6527 (class class class)co 7408 0cc0 11171 ↑𝑟crelexp 15139 |
| 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 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-mulcl 11233 ax-i2m1 11239 |
| 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-sbc 3739 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-iota 6483 df-fun 6529 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-n0 12576 df-relexp 15140 |
| This theorem is used by: fvrcllb0da 44638 fvrtrcllb0da 44680 |
| Copyright terms: Public domain | W3C validator |