| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sprsymrelfv | Structured version Visualization version GIF version | ||
| Description: The value of the function 𝐹 which maps a subset of the set of pairs over a fixed set 𝑉 to the relation relating two elements of the set 𝑉 iff they are in a pair of the subset. (Contributed by AV, 19-Nov-2021.) |
| Ref | Expression |
|---|---|
| sprsymrelf.p | ⊢ 𝑃 = 𝒫 (Pairs‘𝑉) |
| sprsymrelf.r | ⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)} |
| sprsymrelf.f | ⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) |
| Ref | Expression |
|---|---|
| sprsymrelfv | ⊢ (𝑋 ∈ 𝑃 → (𝐹‘𝑋) = {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sprsymrelf.f | . 2 ⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) | |
| 2 | rexeq 3325 | . . 3 ⊢ (𝑝 = 𝑋 → (∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦})) | |
| 3 | 2 | opabbidv 5181 | . 2 ⊢ (𝑝 = 𝑋 → {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} = {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}}) |
| 4 | id 23 | . 2 ⊢ (𝑋 ∈ 𝑃 → 𝑋 ∈ 𝑃) | |
| 5 | elpwi 4574 | . . . 4 ⊢ (𝑋 ∈ 𝒫 (Pairs‘𝑉) → 𝑋 ⊆ (Pairs‘𝑉)) | |
| 6 | sprsymrelf.p | . . . 4 ⊢ 𝑃 = 𝒫 (Pairs‘𝑉) | |
| 7 | 5, 6 | eleq2s 2887 | . . 3 ⊢ (𝑋 ∈ 𝑃 → 𝑋 ⊆ (Pairs‘𝑉)) |
| 8 | sprsymrelfvlem 48128 | . . 3 ⊢ (𝑋 ⊆ (Pairs‘𝑉) → {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)) | |
| 9 | 7, 8 | syl 18 | . 2 ⊢ (𝑋 ∈ 𝑃 → {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)) |
| 10 | 1, 3, 4, 9 | fvmptd3 7014 | 1 ⊢ (𝑋 ∈ 𝑃 → (𝐹‘𝑋) = {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ∃wrex 3095 {crab 3423 ⊆ wss 3913 𝒫 cpw 4567 {cpr 4596 class class class wbr 5113 {copab 5177 ↦ cmpt 5196 × cxp 5660 ‘cfv 6537 Pairscspr 48115 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-spr 48116 |
| This theorem is referenced by: sprsymrelf1 48134 sprsymrelfo 48135 |
| Copyright terms: Public domain | W3C validator |