| 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 3315 | . . 3 ⊢ (𝑝 = 𝑋 → (∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦})) | |
| 3 | 2 | opabbidv 5171 | . 2 ⊢ (𝑝 = 𝑋 → {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}} = {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}}) |
| 4 | id 23 | . 2 ⊢ (𝑋 ∈ 𝑃 → 𝑋 ∈ 𝑃) | |
| 5 | elpwi 4564 | . . . 4 ⊢ (𝑋 ∈ 𝒫 (Pairs‘𝑉) → 𝑋 ⊆ (Pairs‘𝑉)) | |
| 6 | sprsymrelf.p | . . . 4 ⊢ 𝑃 = 𝒫 (Pairs‘𝑉) | |
| 7 | 5, 6 | eleq2s 2878 | . . 3 ⊢ (𝑋 ∈ 𝑃 → 𝑋 ⊆ (Pairs‘𝑉)) |
| 8 | sprsymrelfvlem 48391 | . . 3 ⊢ (𝑋 ⊆ (Pairs‘𝑉) → {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)) | |
| 9 | 7, 8 | syl 18 | . 2 ⊢ (𝑋 ∈ 𝑃 → {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)) |
| 10 | 1, 3, 4, 9 | fvmptd3 7011 | 1 ⊢ (𝑋 ∈ 𝑃 → (𝐹‘𝑋) = {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑋 𝑐 = {𝑥, 𝑦}}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 {crab 3412 ⊆ wss 3899 𝒫 cpw 4557 {cpr 4586 class class class wbr 5103 {copab 5167 ↦ cmpt 5186 × cxp 5653 ‘cfv 6533 Pairscspr 48378 |
| 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 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6489 df-fun 6535 df-fv 6541 df-spr 48379 |
| This theorem is used by: sprsymrelf1 48397 sprsymrelfo 48398 |
| Copyright terms: Public domain | W3C validator |