| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fvmptiunrelexplb1d | Structured version Visualization version GIF version | ||
| Description: If the indexed union ranges over the first power of the relation, then the relation is a subset of the appliction of the function to the relation. (Contributed by RP, 22-Jul-2020.) |
| Ref | Expression |
|---|---|
| fvmptiunrelexplb1d.c | ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) |
| fvmptiunrelexplb1d.r | ⊢ (𝜑 → 𝑅 ∈ V) |
| fvmptiunrelexplb1d.n | ⊢ (𝜑 → 𝑁 ∈ V) |
| fvmptiunrelexplb1d.1 | ⊢ (𝜑 → 1 ∈ 𝑁) |
| Ref | Expression |
|---|---|
| fvmptiunrelexplb1d | ⊢ (𝜑 → 𝑅 ⊆ (𝐶‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvmptiunrelexplb1d.1 | . . 3 ⊢ (𝜑 → 1 ∈ 𝑁) | |
| 2 | oveq2 7428 | . . . 4 ⊢ (𝑛 = 1 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟1)) | |
| 3 | 2 | ssiun2s 5006 | . . 3 ⊢ (1 ∈ 𝑁 → (𝑅↑𝑟1) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 4 | 1, 3 | syl 18 | . 2 ⊢ (𝜑 → (𝑅↑𝑟1) ⊆ ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 5 | fvmptiunrelexplb1d.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ V) | |
| 6 | 5 | relexp1d 15182 | . 2 ⊢ (𝜑 → (𝑅↑𝑟1) = 𝑅) |
| 7 | fvmptiunrelexplb1d.c | . . . 4 ⊢ 𝐶 = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛)) | |
| 8 | oveq1 7427 | . . . . 5 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
| 9 | 8 | iuneq2d 4980 | . . . 4 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ 𝑁 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 10 | fvmptiunrelexplb1d.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ V) | |
| 11 | ovex 7453 | . . . . . 6 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
| 12 | 11 | rgenw 3080 | . . . . 5 ⊢ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V |
| 13 | iunexg 7975 | . . . . 5 ⊢ ((𝑁 ∈ V ∧ ∀𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) | |
| 14 | 10, 12, 13 | sylancl 598 | . . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) ∈ V) |
| 15 | 7, 9, 5, 14 | fvmptd3 7017 | . . 3 ⊢ (𝜑 → (𝐶‘𝑅) = ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛)) |
| 16 | 15 | eqcomd 2766 | . 2 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑁 (𝑅↑𝑟𝑛) = (𝐶‘𝑅)) |
| 17 | 4, 6, 16 | 3sstr3d 3962 | 1 ⊢ (𝜑 → 𝑅 ⊆ (𝐶‘𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ∀wral 3076 Vcvv 3450 ⊆ wss 3895 ∪ ciun 4950 ↦ cmpt 5185 ‘cfv 6538 (class class class)co 7420 1c1 11201 ↑𝑟crelexp 15172 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 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-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-n0 12607 df-z 12694 df-uz 12966 df-seq 14145 df-relexp 15173 |
| This theorem is used by: fvilbdRP 44690 fvrcllb1d 44695 fvtrcllb1d 44722 fvrtrcllb1d 44737 |
| Copyright terms: Public domain | W3C validator |