MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xpsff1o Structured version   Visualization version   GIF version

Theorem xpsff1o 17614
Description: The function appearing in xpsval 17617 is a bijection from the cartesian product to the indexed cartesian product indexed on the pair 2o = {∅, 1o}. (Contributed by Mario Carneiro, 15-Aug-2015.)
Hypothesis
Ref Expression
xpsff1o.f 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩})
Assertion
Ref Expression
xpsff1o 𝐹:(𝐴 × 𝐵)–1-1-ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
Distinct variable groups:   𝐴,𝑘,𝑥,𝑦   𝐵,𝑘,𝑥,𝑦
Allowed substitution hints:   𝐹(𝑥,𝑦,𝑘)

Proof of Theorem xpsff1o
Dummy variables 𝑎 𝑏 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xpsfrnel2 17611 . . . . . 6 ({⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝑥𝐴𝑦𝐵))
21biimpri 228 . . . . 5 ((𝑥𝐴𝑦𝐵) → {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵))
32rgen2 3197 . . . 4 𝑥𝐴𝑦𝐵 {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
4 xpsff1o.f . . . . 5 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩})
54fmpo 8092 . . . 4 (∀𝑥𝐴𝑦𝐵 {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ 𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵))
63, 5mpbi 230 . . 3 𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
7 1st2nd2 8052 . . . . . . . 8 (𝑧 ∈ (𝐴 × 𝐵) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
87fveq2d 6911 . . . . . . 7 (𝑧 ∈ (𝐴 × 𝐵) → (𝐹𝑧) = (𝐹‘⟨(1st𝑧), (2nd𝑧)⟩))
9 df-ov 7434 . . . . . . . 8 ((1st𝑧)𝐹(2nd𝑧)) = (𝐹‘⟨(1st𝑧), (2nd𝑧)⟩)
10 xp1st 8045 . . . . . . . . 9 (𝑧 ∈ (𝐴 × 𝐵) → (1st𝑧) ∈ 𝐴)
11 xp2nd 8046 . . . . . . . . 9 (𝑧 ∈ (𝐴 × 𝐵) → (2nd𝑧) ∈ 𝐵)
124xpsfval 17613 . . . . . . . . 9 (((1st𝑧) ∈ 𝐴 ∧ (2nd𝑧) ∈ 𝐵) → ((1st𝑧)𝐹(2nd𝑧)) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
1310, 11, 12syl2anc 584 . . . . . . . 8 (𝑧 ∈ (𝐴 × 𝐵) → ((1st𝑧)𝐹(2nd𝑧)) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
149, 13eqtr3id 2789 . . . . . . 7 (𝑧 ∈ (𝐴 × 𝐵) → (𝐹‘⟨(1st𝑧), (2nd𝑧)⟩) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
158, 14eqtrd 2775 . . . . . 6 (𝑧 ∈ (𝐴 × 𝐵) → (𝐹𝑧) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
16 1st2nd2 8052 . . . . . . . 8 (𝑤 ∈ (𝐴 × 𝐵) → 𝑤 = ⟨(1st𝑤), (2nd𝑤)⟩)
1716fveq2d 6911 . . . . . . 7 (𝑤 ∈ (𝐴 × 𝐵) → (𝐹𝑤) = (𝐹‘⟨(1st𝑤), (2nd𝑤)⟩))
18 df-ov 7434 . . . . . . . 8 ((1st𝑤)𝐹(2nd𝑤)) = (𝐹‘⟨(1st𝑤), (2nd𝑤)⟩)
19 xp1st 8045 . . . . . . . . 9 (𝑤 ∈ (𝐴 × 𝐵) → (1st𝑤) ∈ 𝐴)
20 xp2nd 8046 . . . . . . . . 9 (𝑤 ∈ (𝐴 × 𝐵) → (2nd𝑤) ∈ 𝐵)
214xpsfval 17613 . . . . . . . . 9 (((1st𝑤) ∈ 𝐴 ∧ (2nd𝑤) ∈ 𝐵) → ((1st𝑤)𝐹(2nd𝑤)) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2219, 20, 21syl2anc 584 . . . . . . . 8 (𝑤 ∈ (𝐴 × 𝐵) → ((1st𝑤)𝐹(2nd𝑤)) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2318, 22eqtr3id 2789 . . . . . . 7 (𝑤 ∈ (𝐴 × 𝐵) → (𝐹‘⟨(1st𝑤), (2nd𝑤)⟩) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2417, 23eqtrd 2775 . . . . . 6 (𝑤 ∈ (𝐴 × 𝐵) → (𝐹𝑤) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2515, 24eqeqan12d 2749 . . . . 5 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ((𝐹𝑧) = (𝐹𝑤) ↔ {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}))
26 fveq1 6906 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘∅) = ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘∅))
27 fvex 6920 . . . . . . . . 9 (1st𝑧) ∈ V
28 fvpr0o 17606 . . . . . . . . 9 ((1st𝑧) ∈ V → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘∅) = (1st𝑧))
2927, 28ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘∅) = (1st𝑧)
30 fvex 6920 . . . . . . . . 9 (1st𝑤) ∈ V
31 fvpr0o 17606 . . . . . . . . 9 ((1st𝑤) ∈ V → ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘∅) = (1st𝑤))
3230, 31ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘∅) = (1st𝑤)
3326, 29, 323eqtr3g 2798 . . . . . . 7 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → (1st𝑧) = (1st𝑤))
34 fveq1 6906 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘1o) = ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘1o))
35 fvex 6920 . . . . . . . . 9 (2nd𝑧) ∈ V
36 fvpr1o 17607 . . . . . . . . 9 ((2nd𝑧) ∈ V → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘1o) = (2nd𝑧))
3735, 36ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘1o) = (2nd𝑧)
38 fvex 6920 . . . . . . . . 9 (2nd𝑤) ∈ V
39 fvpr1o 17607 . . . . . . . . 9 ((2nd𝑤) ∈ V → ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘1o) = (2nd𝑤))
4038, 39ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘1o) = (2nd𝑤)
4134, 37, 403eqtr3g 2798 . . . . . . 7 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → (2nd𝑧) = (2nd𝑤))
4233, 41opeq12d 4886 . . . . . 6 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → ⟨(1st𝑧), (2nd𝑧)⟩ = ⟨(1st𝑤), (2nd𝑤)⟩)
437, 16eqeqan12d 2749 . . . . . 6 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → (𝑧 = 𝑤 ↔ ⟨(1st𝑧), (2nd𝑧)⟩ = ⟨(1st𝑤), (2nd𝑤)⟩))
4442, 43imbitrrid 246 . . . . 5 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → 𝑧 = 𝑤))
4525, 44sylbid 240 . . . 4 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤))
4645rgen2 3197 . . 3 𝑧 ∈ (𝐴 × 𝐵)∀𝑤 ∈ (𝐴 × 𝐵)((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)
47 dff13 7275 . . 3 (𝐹:(𝐴 × 𝐵)–1-1X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ∧ ∀𝑧 ∈ (𝐴 × 𝐵)∀𝑤 ∈ (𝐴 × 𝐵)((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
486, 46, 47mpbir2an 711 . 2 𝐹:(𝐴 × 𝐵)–1-1X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
49 xpsfrnel 17609 . . . . . 6 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝑧 Fn 2o ∧ (𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1o) ∈ 𝐵))
5049simp2bi 1145 . . . . 5 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → (𝑧‘∅) ∈ 𝐴)
5149simp3bi 1146 . . . . 5 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → (𝑧‘1o) ∈ 𝐵)
524xpsfval 17613 . . . . . . 7 (((𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1o) ∈ 𝐵) → ((𝑧‘∅)𝐹(𝑧‘1o)) = {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩})
5350, 51, 52syl2anc 584 . . . . . 6 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → ((𝑧‘∅)𝐹(𝑧‘1o)) = {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩})
54 ixpfn 8942 . . . . . . 7 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → 𝑧 Fn 2o)
55 xpsfeq 17610 . . . . . . 7 (𝑧 Fn 2o → {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩} = 𝑧)
5654, 55syl 17 . . . . . 6 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩} = 𝑧)
5753, 56eqtr2d 2776 . . . . 5 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → 𝑧 = ((𝑧‘∅)𝐹(𝑧‘1o)))
58 rspceov 7480 . . . . 5 (((𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1o) ∈ 𝐵𝑧 = ((𝑧‘∅)𝐹(𝑧‘1o))) → ∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏))
5950, 51, 57, 58syl3anc 1370 . . . 4 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → ∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏))
6059rgen 3061 . . 3 𝑧X 𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏)
61 foov 7607 . . 3 (𝐹:(𝐴 × 𝐵)–ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ∧ ∀𝑧X 𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏)))
626, 60, 61mpbir2an 711 . 2 𝐹:(𝐴 × 𝐵)–ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
63 df-f1o 6570 . 2 (𝐹:(𝐴 × 𝐵)–1-1-ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)–1-1X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ∧ 𝐹:(𝐴 × 𝐵)–ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)))
6448, 62, 63mpbir2an 711 1 𝐹:(𝐴 × 𝐵)–1-1-ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  wral 3059  wrex 3068  Vcvv 3478  c0 4339  ifcif 4531  {cpr 4633  cop 4637   × cxp 5687   Fn wfn 6558  wf 6559  1-1wf1 6560  ontowfo 6561  1-1-ontowf1o 6562  cfv 6563  (class class class)co 7431  cmpo 7433  1st c1st 8011  2nd c2nd 8012  1oc1o 8498  2oc2o 8499  Xcixp 8936
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-1o 8505  df-2o 8506  df-ixp 8937  df-en 8985  df-fin 8988
This theorem is referenced by:  xpsfrn  17615  xpsff1o2  17616
  Copyright terms: Public domain W3C validator