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

Theorem xpsff1o 17653
Description: The function appearing in xpsval 17656 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 17650 . . . . . 6 ({⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝑥𝐴𝑦𝐵))
21biimpri 231 . . . . 5 ((𝑥𝐴𝑦𝐵) → {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵))
32rgen2 3202 . . . 4 𝑥𝐴𝑦𝐵 {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
4 xpsff1o.f . . . . 5 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩})
54fmpo 8065 . . . 4 (∀𝑥𝐴𝑦𝐵 {⟨∅, 𝑥⟩, ⟨1o, 𝑦⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ 𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵))
63, 5mpbi 233 . . 3 𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
7 1st2nd2 8025 . . . . . . . 8 (𝑧 ∈ (𝐴 × 𝐵) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
87fveq2d 6882 . . . . . . 7 (𝑧 ∈ (𝐴 × 𝐵) → (𝐹𝑧) = (𝐹‘⟨(1st𝑧), (2nd𝑧)⟩))
9 df-ov 7416 . . . . . . . 8 ((1st𝑧)𝐹(2nd𝑧)) = (𝐹‘⟨(1st𝑧), (2nd𝑧)⟩)
10 xp1st 8018 . . . . . . . . 9 (𝑧 ∈ (𝐴 × 𝐵) → (1st𝑧) ∈ 𝐴)
11 xp2nd 8019 . . . . . . . . 9 (𝑧 ∈ (𝐴 × 𝐵) → (2nd𝑧) ∈ 𝐵)
124xpsfval 17652 . . . . . . . . 9 (((1st𝑧) ∈ 𝐴 ∧ (2nd𝑧) ∈ 𝐵) → ((1st𝑧)𝐹(2nd𝑧)) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
1310, 11, 12syl2anc 596 . . . . . . . 8 (𝑧 ∈ (𝐴 × 𝐵) → ((1st𝑧)𝐹(2nd𝑧)) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
149, 13eqtr3id 2809 . . . . . . 7 (𝑧 ∈ (𝐴 × 𝐵) → (𝐹‘⟨(1st𝑧), (2nd𝑧)⟩) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
158, 14eqtrd 2795 . . . . . 6 (𝑧 ∈ (𝐴 × 𝐵) → (𝐹𝑧) = {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩})
16 1st2nd2 8025 . . . . . . . 8 (𝑤 ∈ (𝐴 × 𝐵) → 𝑤 = ⟨(1st𝑤), (2nd𝑤)⟩)
1716fveq2d 6882 . . . . . . 7 (𝑤 ∈ (𝐴 × 𝐵) → (𝐹𝑤) = (𝐹‘⟨(1st𝑤), (2nd𝑤)⟩))
18 df-ov 7416 . . . . . . . 8 ((1st𝑤)𝐹(2nd𝑤)) = (𝐹‘⟨(1st𝑤), (2nd𝑤)⟩)
19 xp1st 8018 . . . . . . . . 9 (𝑤 ∈ (𝐴 × 𝐵) → (1st𝑤) ∈ 𝐴)
20 xp2nd 8019 . . . . . . . . 9 (𝑤 ∈ (𝐴 × 𝐵) → (2nd𝑤) ∈ 𝐵)
214xpsfval 17652 . . . . . . . . 9 (((1st𝑤) ∈ 𝐴 ∧ (2nd𝑤) ∈ 𝐵) → ((1st𝑤)𝐹(2nd𝑤)) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2219, 20, 21syl2anc 596 . . . . . . . 8 (𝑤 ∈ (𝐴 × 𝐵) → ((1st𝑤)𝐹(2nd𝑤)) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2318, 22eqtr3id 2809 . . . . . . 7 (𝑤 ∈ (𝐴 × 𝐵) → (𝐹‘⟨(1st𝑤), (2nd𝑤)⟩) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2417, 23eqtrd 2795 . . . . . 6 (𝑤 ∈ (𝐴 × 𝐵) → (𝐹𝑤) = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩})
2515, 24eqeqan12d 2774 . . . . 5 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ((𝐹𝑧) = (𝐹𝑤) ↔ {⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}))
26 fveq1 6877 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘∅) = ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘∅))
27 fvex 6891 . . . . . . . . 9 (1st𝑧) ∈ V
28 fvpr0o 17645 . . . . . . . . 9 ((1st𝑧) ∈ V → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘∅) = (1st𝑧))
2927, 28ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘∅) = (1st𝑧)
30 fvex 6891 . . . . . . . . 9 (1st𝑤) ∈ V
31 fvpr0o 17645 . . . . . . . . 9 ((1st𝑤) ∈ V → ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘∅) = (1st𝑤))
3230, 31ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘∅) = (1st𝑤)
3326, 29, 323eqtr3g 2818 . . . . . . 7 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → (1st𝑧) = (1st𝑤))
34 fveq1 6877 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘1o) = ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘1o))
35 fvex 6891 . . . . . . . . 9 (2nd𝑧) ∈ V
36 fvpr1o 17646 . . . . . . . . 9 ((2nd𝑧) ∈ V → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘1o) = (2nd𝑧))
3735, 36ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩}‘1o) = (2nd𝑧)
38 fvex 6891 . . . . . . . . 9 (2nd𝑤) ∈ V
39 fvpr1o 17646 . . . . . . . . 9 ((2nd𝑤) ∈ V → ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘1o) = (2nd𝑤))
4038, 39ax-mp 5 . . . . . . . 8 ({⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩}‘1o) = (2nd𝑤)
4134, 37, 403eqtr3g 2818 . . . . . . 7 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → (2nd𝑧) = (2nd𝑤))
4233, 41opeq12d 4841 . . . . . 6 ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → ⟨(1st𝑧), (2nd𝑧)⟩ = ⟨(1st𝑤), (2nd𝑤)⟩)
437, 16eqeqan12d 2774 . . . . . 6 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → (𝑧 = 𝑤 ↔ ⟨(1st𝑧), (2nd𝑧)⟩ = ⟨(1st𝑤), (2nd𝑤)⟩))
4442, 43imbitrrid 249 . . . . 5 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ({⟨∅, (1st𝑧)⟩, ⟨1o, (2nd𝑧)⟩} = {⟨∅, (1st𝑤)⟩, ⟨1o, (2nd𝑤)⟩} → 𝑧 = 𝑤))
4525, 44sylbid 243 . . . 4 ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤))
4645rgen2 3202 . . 3 𝑧 ∈ (𝐴 × 𝐵)∀𝑤 ∈ (𝐴 × 𝐵)((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)
47 dff13 7251 . . 3 (𝐹:(𝐴 × 𝐵)–1-1X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ∧ ∀𝑧 ∈ (𝐴 × 𝐵)∀𝑤 ∈ (𝐴 × 𝐵)((𝐹𝑧) = (𝐹𝑤) → 𝑧 = 𝑤)))
486, 46, 47mpbir2an 724 . 2 𝐹:(𝐴 × 𝐵)–1-1X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
49 xpsfrnel 17648 . . . . . 6 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝑧 Fn 2o ∧ (𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1o) ∈ 𝐵))
5049simp2bi 1164 . . . . 5 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → (𝑧‘∅) ∈ 𝐴)
5149simp3bi 1165 . . . . 5 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → (𝑧‘1o) ∈ 𝐵)
524xpsfval 17652 . . . . . . 7 (((𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1o) ∈ 𝐵) → ((𝑧‘∅)𝐹(𝑧‘1o)) = {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩})
5350, 51, 52syl2anc 596 . . . . . 6 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → ((𝑧‘∅)𝐹(𝑧‘1o)) = {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩})
54 ixpfn 8910 . . . . . . 7 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → 𝑧 Fn 2o)
55 xpsfeq 17649 . . . . . . 7 (𝑧 Fn 2o → {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩} = 𝑧)
5654, 55syl 18 . . . . . 6 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → {⟨∅, (𝑧‘∅)⟩, ⟨1o, (𝑧‘1o)⟩} = 𝑧)
5753, 56eqtr2d 2796 . . . . 5 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → 𝑧 = ((𝑧‘∅)𝐹(𝑧‘1o)))
58 rspceov 7462 . . . . 5 (((𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1o) ∈ 𝐵𝑧 = ((𝑧‘∅)𝐹(𝑧‘1o))) → ∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏))
5950, 51, 57, 58syl3anc 1398 . . . 4 (𝑧X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) → ∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏))
6059rgen 3078 . . 3 𝑧X 𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏)
61 foov 7588 . . 3 (𝐹:(𝐴 × 𝐵)–ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ∧ ∀𝑧X 𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)∃𝑎𝐴𝑏𝐵 𝑧 = (𝑎𝐹𝑏)))
626, 60, 61mpbir2an 724 . 2 𝐹:(𝐴 × 𝐵)–ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
63 df-f1o 6540 . 2 (𝐹:(𝐴 × 𝐵)–1-1-ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)–1-1X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵) ∧ 𝐹:(𝐴 × 𝐵)–ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)))
6448, 62, 63mpbir2an 724 1 𝐹:(𝐴 × 𝐵)–1-1-ontoX𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3076  wrex 3086  Vcvv 3450  c0 4279  ifcif 4482  {cpr 4586  cop 4590   × cxp 5653   Fn wfn 6528  wf 6529  1-1wf1 6530  ontowfo 6531  1-1-ontowf1o 6532  cfv 6533  (class class class)co 7413  cmpo 7415  1st c1st 7984  2nd c2nd 7985  1oc1o 8448  2oc2o 8449  Xcixp 8904
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-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-reu 3366  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-pss 3919  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-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-1o 8455  df-2o 8456  df-ixp 8905  df-en 8953  df-fin 8956
This theorem is used by:  xpsfrn  17654  xpsff1o2  17655
  Copyright terms: Public domain W3C validator