| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > uspgrbisymrelALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of uspgrbisymrel 48645 not using the definition of equinumerosity. (Contributed by AV, 26-Nov-2021.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| uspgrbisymrel.g | ⊢ 𝐺 = {〈𝑣, 𝑒〉 ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))} |
| uspgrbisymrel.r | ⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)} |
| Ref | Expression |
|---|---|
| uspgrbisymrelALT | ⊢ (𝑉 ∈ 𝑊 → ∃𝑓 𝑓:𝐺–1-1-onto→𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6848 | . . . . 5 ⊢ (Pairs‘𝑉) ∈ V | |
| 2 | 1 | pwex 5318 | . . . 4 ⊢ 𝒫 (Pairs‘𝑉) ∈ V |
| 3 | mptexg 7170 | . . . 4 ⊢ (𝒫 (Pairs‘𝑉) ∈ V → (𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∈ V) | |
| 4 | 2, 3 | mp1i 13 | . . 3 ⊢ (𝑉 ∈ 𝑊 → (𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∈ V) |
| 5 | eqid 2737 | . . . . 5 ⊢ 𝒫 (Pairs‘𝑉) = 𝒫 (Pairs‘𝑉) | |
| 6 | uspgrbisymrel.g | . . . . 5 ⊢ 𝐺 = {〈𝑣, 𝑒〉 ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))} | |
| 7 | 5, 6 | uspgrex 48641 | . . . 4 ⊢ (𝑉 ∈ 𝑊 → 𝐺 ∈ V) |
| 8 | mptexg 7170 | . . . 4 ⊢ (𝐺 ∈ V → (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)) ∈ V) | |
| 9 | 7, 8 | syl 17 | . . 3 ⊢ (𝑉 ∈ 𝑊 → (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)) ∈ V) |
| 10 | coexg 7874 | . . 3 ⊢ (((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∈ V ∧ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)) ∈ V) → ((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))) ∈ V) | |
| 11 | 4, 9, 10 | syl2anc 585 | . 2 ⊢ (𝑉 ∈ 𝑊 → ((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))) ∈ V) |
| 12 | uspgrbisymrel.r | . . . 4 ⊢ 𝑅 = {𝑟 ∈ 𝒫 (𝑉 × 𝑉) ∣ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥𝑟𝑦 ↔ 𝑦𝑟𝑥)} | |
| 13 | eqid 2737 | . . . 4 ⊢ (𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) = (𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) | |
| 14 | 5, 12, 13 | sprsymrelf1o 47973 | . . 3 ⊢ (𝑉 ∈ 𝑊 → (𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}):𝒫 (Pairs‘𝑉)–1-1-onto→𝑅) |
| 15 | eqid 2737 | . . . 4 ⊢ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)) = (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)) | |
| 16 | 5, 6, 15 | uspgrsprf1o 48640 | . . 3 ⊢ (𝑉 ∈ 𝑊 → (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)):𝐺–1-1-onto→𝒫 (Pairs‘𝑉)) |
| 17 | f1oco 6798 | . . 3 ⊢ (((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}):𝒫 (Pairs‘𝑉)–1-1-onto→𝑅 ∧ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔)):𝐺–1-1-onto→𝒫 (Pairs‘𝑉)) → ((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))):𝐺–1-1-onto→𝑅) | |
| 18 | 14, 16, 17 | syl2anc 585 | . 2 ⊢ (𝑉 ∈ 𝑊 → ((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))):𝐺–1-1-onto→𝑅) |
| 19 | f1oeq1 6763 | . . 3 ⊢ (𝑓 = ((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))) → (𝑓:𝐺–1-1-onto→𝑅 ↔ ((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))):𝐺–1-1-onto→𝑅)) | |
| 20 | 19 | spcegv 3540 | . 2 ⊢ (((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))) ∈ V → (((𝑝 ∈ 𝒫 (Pairs‘𝑉) ↦ {〈𝑥, 𝑦〉 ∣ ∃𝑐 ∈ 𝑝 𝑐 = {𝑥, 𝑦}}) ∘ (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))):𝐺–1-1-onto→𝑅 → ∃𝑓 𝑓:𝐺–1-1-onto→𝑅)) |
| 21 | 11, 18, 20 | sylc 65 | 1 ⊢ (𝑉 ∈ 𝑊 → ∃𝑓 𝑓:𝐺–1-1-onto→𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 {crab 3390 Vcvv 3430 𝒫 cpw 4542 {cpr 4570 class class class wbr 5086 {copab 5148 ↦ cmpt 5167 × cxp 5623 ∘ ccom 5629 –1-1-onto→wf1o 6492 ‘cfv 6493 2nd c2nd 7935 Vtxcvtx 29082 Edgcedg 29133 USPGraphcuspgr 29234 Pairscspr 47952 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9819 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-n0 12432 df-xnn0 12505 df-z 12519 df-uz 12783 df-fz 13456 df-hash 14287 df-vtx 29084 df-iedg 29085 df-edg 29134 df-upgr 29168 df-uspgr 29236 df-spr 47953 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |