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

Theorem ixpsnf1o 8932
Description: A bijection between a class and single-point functions to it. (Contributed by Stefan O'Rear, 24-Jan-2015.)
Hypothesis
Ref Expression
ixpsnf1o.f 𝐹 = (𝑥𝐴 ↦ ({𝐼} × {𝑥}))
Assertion
Ref Expression
ixpsnf1o (𝐼𝑉𝐹:𝐴1-1-ontoX𝑦 ∈ {𝐼}𝐴)
Distinct variable groups:   𝑥,𝐼,𝑦   𝑥,𝐴,𝑦   𝑥,𝑉,𝑦   𝑦,𝐹
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem ixpsnf1o
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ixpsnf1o.f . 2 𝐹 = (𝑥𝐴 ↦ ({𝐼} × {𝑥}))
2 snex 5432 . . . 4 {𝐼} ∈ V
3 snex 5432 . . . 4 {𝑥} ∈ V
42, 3xpex 7740 . . 3 ({𝐼} × {𝑥}) ∈ V
54a1i 11 . 2 ((𝐼𝑉𝑥𝐴) → ({𝐼} × {𝑥}) ∈ V)
6 vex 3479 . . . . 5 𝑎 ∈ V
76rnex 7903 . . . 4 ran 𝑎 ∈ V
87uniex 7731 . . 3 ran 𝑎 ∈ V
98a1i 11 . 2 ((𝐼𝑉𝑎X𝑦 ∈ {𝐼}𝐴) → ran 𝑎 ∈ V)
10 sneq 4639 . . . . . 6 (𝑏 = 𝐼 → {𝑏} = {𝐼})
1110xpeq1d 5706 . . . . 5 (𝑏 = 𝐼 → ({𝑏} × {𝑥}) = ({𝐼} × {𝑥}))
1211eqeq2d 2744 . . . 4 (𝑏 = 𝐼 → (𝑎 = ({𝑏} × {𝑥}) ↔ 𝑎 = ({𝐼} × {𝑥})))
1312anbi2d 630 . . 3 (𝑏 = 𝐼 → ((𝑥𝐴𝑎 = ({𝑏} × {𝑥})) ↔ (𝑥𝐴𝑎 = ({𝐼} × {𝑥}))))
14 elixpsn 8931 . . . . . 6 (𝑏 ∈ V → (𝑎X𝑦 ∈ {𝑏}𝐴 ↔ ∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩}))
1514elv 3481 . . . . 5 (𝑎X𝑦 ∈ {𝑏}𝐴 ↔ ∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩})
1610ixpeq1d 8903 . . . . . 6 (𝑏 = 𝐼X𝑦 ∈ {𝑏}𝐴 = X𝑦 ∈ {𝐼}𝐴)
1716eleq2d 2820 . . . . 5 (𝑏 = 𝐼 → (𝑎X𝑦 ∈ {𝑏}𝐴𝑎X𝑦 ∈ {𝐼}𝐴))
1815, 17bitr3id 285 . . . 4 (𝑏 = 𝐼 → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ↔ 𝑎X𝑦 ∈ {𝐼}𝐴))
1918anbi1d 631 . . 3 (𝑏 = 𝐼 → ((∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎) ↔ (𝑎X𝑦 ∈ {𝐼}𝐴𝑥 = ran 𝑎)))
20 vex 3479 . . . . . . 7 𝑏 ∈ V
21 vex 3479 . . . . . . 7 𝑥 ∈ V
2220, 21xpsn 7139 . . . . . 6 ({𝑏} × {𝑥}) = {⟨𝑏, 𝑥⟩}
2322eqeq2i 2746 . . . . 5 (𝑎 = ({𝑏} × {𝑥}) ↔ 𝑎 = {⟨𝑏, 𝑥⟩})
2423anbi2i 624 . . . 4 ((𝑥𝐴𝑎 = ({𝑏} × {𝑥})) ↔ (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}))
25 eqid 2733 . . . . . . . . 9 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑥⟩}
26 opeq2 4875 . . . . . . . . . . 11 (𝑐 = 𝑥 → ⟨𝑏, 𝑐⟩ = ⟨𝑏, 𝑥⟩)
2726sneqd 4641 . . . . . . . . . 10 (𝑐 = 𝑥 → {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})
2827rspceeqv 3634 . . . . . . . . 9 ((𝑥𝐴 ∧ {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑥⟩}) → ∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩})
2925, 28mpan2 690 . . . . . . . 8 (𝑥𝐴 → ∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩})
3020, 21op2nda 6228 . . . . . . . . 9 ran {⟨𝑏, 𝑥⟩} = 𝑥
3130eqcomi 2742 . . . . . . . 8 𝑥 = ran {⟨𝑏, 𝑥⟩}
3229, 31jctir 522 . . . . . . 7 (𝑥𝐴 → (∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran {⟨𝑏, 𝑥⟩}))
33 eqeq1 2737 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑥⟩} → (𝑎 = {⟨𝑏, 𝑐⟩} ↔ {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩}))
3433rexbidv 3179 . . . . . . . 8 (𝑎 = {⟨𝑏, 𝑥⟩} → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ↔ ∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩}))
35 rneq 5936 . . . . . . . . . 10 (𝑎 = {⟨𝑏, 𝑥⟩} → ran 𝑎 = ran {⟨𝑏, 𝑥⟩})
3635unieqd 4923 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑥⟩} → ran 𝑎 = ran {⟨𝑏, 𝑥⟩})
3736eqeq2d 2744 . . . . . . . 8 (𝑎 = {⟨𝑏, 𝑥⟩} → (𝑥 = ran 𝑎𝑥 = ran {⟨𝑏, 𝑥⟩}))
3834, 37anbi12d 632 . . . . . . 7 (𝑎 = {⟨𝑏, 𝑥⟩} → ((∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎) ↔ (∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran {⟨𝑏, 𝑥⟩})))
3932, 38syl5ibrcom 246 . . . . . 6 (𝑥𝐴 → (𝑎 = {⟨𝑏, 𝑥⟩} → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎)))
4039imp 408 . . . . 5 ((𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}) → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎))
41 vex 3479 . . . . . . . . . . 11 𝑐 ∈ V
4220, 41op2nda 6228 . . . . . . . . . 10 ran {⟨𝑏, 𝑐⟩} = 𝑐
4342eqeq2i 2746 . . . . . . . . 9 (𝑥 = ran {⟨𝑏, 𝑐⟩} ↔ 𝑥 = 𝑐)
44 eqidd 2734 . . . . . . . . . . 11 (𝑐𝐴 → {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩})
4544ancli 550 . . . . . . . . . 10 (𝑐𝐴 → (𝑐𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩}))
46 eleq1w 2817 . . . . . . . . . . 11 (𝑥 = 𝑐 → (𝑥𝐴𝑐𝐴))
47 opeq2 4875 . . . . . . . . . . . . 13 (𝑥 = 𝑐 → ⟨𝑏, 𝑥⟩ = ⟨𝑏, 𝑐⟩)
4847sneqd 4641 . . . . . . . . . . . 12 (𝑥 = 𝑐 → {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩})
4948eqeq2d 2744 . . . . . . . . . . 11 (𝑥 = 𝑐 → ({⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩} ↔ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩}))
5046, 49anbi12d 632 . . . . . . . . . 10 (𝑥 = 𝑐 → ((𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩}) ↔ (𝑐𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩})))
5145, 50syl5ibrcom 246 . . . . . . . . 9 (𝑐𝐴 → (𝑥 = 𝑐 → (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})))
5243, 51biimtrid 241 . . . . . . . 8 (𝑐𝐴 → (𝑥 = ran {⟨𝑏, 𝑐⟩} → (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})))
53 rneq 5936 . . . . . . . . . . 11 (𝑎 = {⟨𝑏, 𝑐⟩} → ran 𝑎 = ran {⟨𝑏, 𝑐⟩})
5453unieqd 4923 . . . . . . . . . 10 (𝑎 = {⟨𝑏, 𝑐⟩} → ran 𝑎 = ran {⟨𝑏, 𝑐⟩})
5554eqeq2d 2744 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑐⟩} → (𝑥 = ran 𝑎𝑥 = ran {⟨𝑏, 𝑐⟩}))
56 eqeq1 2737 . . . . . . . . . 10 (𝑎 = {⟨𝑏, 𝑐⟩} → (𝑎 = {⟨𝑏, 𝑥⟩} ↔ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩}))
5756anbi2d 630 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑐⟩} → ((𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}) ↔ (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})))
5855, 57imbi12d 345 . . . . . . . 8 (𝑎 = {⟨𝑏, 𝑐⟩} → ((𝑥 = ran 𝑎 → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩})) ↔ (𝑥 = ran {⟨𝑏, 𝑐⟩} → (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩}))))
5952, 58syl5ibrcom 246 . . . . . . 7 (𝑐𝐴 → (𝑎 = {⟨𝑏, 𝑐⟩} → (𝑥 = ran 𝑎 → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}))))
6059rexlimiv 3149 . . . . . 6 (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} → (𝑥 = ran 𝑎 → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩})))
6160imp 408 . . . . 5 ((∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎) → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}))
6240, 61impbii 208 . . . 4 ((𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}) ↔ (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎))
6324, 62bitri 275 . . 3 ((𝑥𝐴𝑎 = ({𝑏} × {𝑥})) ↔ (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎))
6413, 19, 63vtoclbg 3560 . 2 (𝐼𝑉 → ((𝑥𝐴𝑎 = ({𝐼} × {𝑥})) ↔ (𝑎X𝑦 ∈ {𝐼}𝐴𝑥 = ran 𝑎)))
651, 5, 9, 64f1od 7658 1 (𝐼𝑉𝐹:𝐴1-1-ontoX𝑦 ∈ {𝐼}𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wrex 3071  Vcvv 3475  {csn 4629  cop 4635   cuni 4909  cmpt 5232   × cxp 5675  ran crn 5678  1-1-ontowf1o 6543  Xcixp 8891
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ixp 8892
This theorem is referenced by:  mapsnf1o  8933
  Copyright terms: Public domain W3C validator