Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fpwrelmapffs Structured version   Visualization version   GIF version

Theorem fpwrelmapffs 29849
 Description: Define a canonical mapping between finite relations (finite subsets of a cartesian product) and functions with finite support into finite subsets. (Contributed by Thierry Arnoux, 28-Aug-2017.) (Revised by Thierry Arnoux, 1-Sep-2019.)
Hypotheses
Ref Expression
fpwrelmap.1 𝐴 ∈ V
fpwrelmap.2 𝐵 ∈ V
fpwrelmap.3 𝑀 = (𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))})
fpwrelmapffs.1 𝑆 = {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑𝑚 𝐴) ∣ (𝑓 supp ∅) ∈ Fin}
Assertion
Ref Expression
fpwrelmapffs (𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin)
Distinct variable groups:   𝑥,𝑓,𝑦,𝐴   𝐵,𝑓,𝑥,𝑦
Allowed substitution hints:   𝑆(𝑥,𝑦,𝑓)   𝑀(𝑥,𝑦,𝑓)

Proof of Theorem fpwrelmapffs
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 fpwrelmap.3 . . . 4 𝑀 = (𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))})
2 fpwrelmap.1 . . . . . 6 𝐴 ∈ V
3 fpwrelmap.2 . . . . . 6 𝐵 ∈ V
42, 3, 1fpwrelmap 29848 . . . . 5 𝑀:(𝒫 𝐵𝑚 𝐴)–1-1-onto→𝒫 (𝐴 × 𝐵)
54a1i 11 . . . 4 (⊤ → 𝑀:(𝒫 𝐵𝑚 𝐴)–1-1-onto→𝒫 (𝐴 × 𝐵))
6 simpl 468 . . . . . . 7 ((𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → 𝑓 ∈ (𝒫 𝐵𝑚 𝐴))
73pwex 4982 . . . . . . . 8 𝒫 𝐵 ∈ V
87, 2elmap 8042 . . . . . . 7 (𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ↔ 𝑓:𝐴⟶𝒫 𝐵)
96, 8sylib 208 . . . . . 6 ((𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → 𝑓:𝐴⟶𝒫 𝐵)
10 simpr 471 . . . . . 6 ((𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))})
112, 3, 9, 10fpwrelmapffslem 29847 . . . . 5 ((𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → (𝑟 ∈ Fin ↔ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)))
12113adant1 1124 . . . 4 ((⊤ ∧ 𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∧ 𝑟 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝑓𝑥))}) → (𝑟 ∈ Fin ↔ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)))
131, 5, 12f1oresrab 6540 . . 3 (⊤ → (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin})
1413trud 1641 . 2 (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}
15 fpwrelmapffs.1 . . . . 5 𝑆 = {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑𝑚 𝐴) ∣ (𝑓 supp ∅) ∈ Fin}
162, 7maprnin 29846 . . . . . 6 ((𝒫 𝐵 ∩ Fin) ↑𝑚 𝐴) = {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ ran 𝑓 ⊆ Fin}
17 nfcv 2913 . . . . . . 7 𝑓((𝒫 𝐵 ∩ Fin) ↑𝑚 𝐴)
18 nfrab1 3271 . . . . . . 7 𝑓{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ ran 𝑓 ⊆ Fin}
1917, 18rabeqf 3340 . . . . . 6 (((𝒫 𝐵 ∩ Fin) ↑𝑚 𝐴) = {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ ran 𝑓 ⊆ Fin} → {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑𝑚 𝐴) ∣ (𝑓 supp ∅) ∈ Fin} = {𝑓 ∈ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ ran 𝑓 ⊆ Fin} ∣ (𝑓 supp ∅) ∈ Fin})
2016, 19ax-mp 5 . . . . 5 {𝑓 ∈ ((𝒫 𝐵 ∩ Fin) ↑𝑚 𝐴) ∣ (𝑓 supp ∅) ∈ Fin} = {𝑓 ∈ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ ran 𝑓 ⊆ Fin} ∣ (𝑓 supp ∅) ∈ Fin}
21 rabrab 3265 . . . . 5 {𝑓 ∈ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ ran 𝑓 ⊆ Fin} ∣ (𝑓 supp ∅) ∈ Fin} = {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}
2215, 20, 213eqtri 2797 . . . 4 𝑆 = {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}
23 dfin5 3731 . . . 4 (𝒫 (𝐴 × 𝐵) ∩ Fin) = {𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}
24 f1oeq23 6272 . . . 4 ((𝑆 = {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)} ∧ (𝒫 (𝐴 × 𝐵) ∩ Fin) = {𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}) → ((𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin) ↔ (𝑀𝑆):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}))
2522, 23, 24mp2an 672 . . 3 ((𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin) ↔ (𝑀𝑆):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin})
2622reseq2i 5530 . . . 4 (𝑀𝑆) = (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)})
27 f1oeq1 6269 . . . 4 ((𝑀𝑆) = (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}) → ((𝑀𝑆):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin} ↔ (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin}))
2826, 27ax-mp 5 . . 3 ((𝑀𝑆):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin} ↔ (𝑀 ↾ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin})
2925, 28bitr2i 265 . 2 ((𝑀 ↾ {𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}):{𝑓 ∈ (𝒫 𝐵𝑚 𝐴) ∣ (ran 𝑓 ⊆ Fin ∧ (𝑓 supp ∅) ∈ Fin)}–1-1-onto→{𝑟 ∈ 𝒫 (𝐴 × 𝐵) ∣ 𝑟 ∈ Fin} ↔ (𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin))
3014, 29mpbi 220 1 (𝑀𝑆):𝑆1-1-onto→(𝒫 (𝐴 × 𝐵) ∩ Fin)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 382   = wceq 1631  ⊤wtru 1632   ∈ wcel 2145  {crab 3065  Vcvv 3351   ∩ cin 3722   ⊆ wss 3723  ∅c0 4063  𝒫 cpw 4298  {copab 4847   ↦ cmpt 4864   × cxp 5248  ran crn 5251   ↾ cres 5252  ⟶wf 6026  –1-1-onto→wf1o 6029  ‘cfv 6030  (class class class)co 6796   supp csupp 7450   ↑𝑚 cmap 8013  Fincfn 8113 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4905  ax-sep 4916  ax-nul 4924  ax-pow 4975  ax-pr 5035  ax-un 7100  ax-ac2 9491 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3or 1072  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4227  df-pw 4300  df-sn 4318  df-pr 4320  df-tp 4322  df-op 4324  df-uni 4576  df-int 4613  df-iun 4657  df-br 4788  df-opab 4848  df-mpt 4865  df-tr 4888  df-id 5158  df-eprel 5163  df-po 5171  df-so 5172  df-fr 5209  df-se 5210  df-we 5211  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-rn 5261  df-res 5262  df-ima 5263  df-pred 5822  df-ord 5868  df-on 5869  df-lim 5870  df-suc 5871  df-iota 5993  df-fun 6032  df-fn 6033  df-f 6034  df-f1 6035  df-fo 6036  df-f1o 6037  df-fv 6038  df-isom 6039  df-riota 6757  df-ov 6799  df-oprab 6800  df-mpt2 6801  df-om 7217  df-1st 7319  df-2nd 7320  df-supp 7451  df-wrecs 7563  df-recs 7625  df-rdg 7663  df-1o 7717  df-oadd 7721  df-er 7900  df-map 8015  df-en 8114  df-dom 8115  df-fin 8117  df-card 8969  df-acn 8972  df-ac 9143 This theorem is referenced by:  eulerpartlem1  30769
 Copyright terms: Public domain W3C validator