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

Theorem ixpsnf1o 8498
 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 5319 . . . 4 {𝐼} ∈ V
3 snex 5319 . . . 4 {𝑥} ∈ V
42, 3xpex 7470 . . 3 ({𝐼} × {𝑥}) ∈ V
54a1i 11 . 2 ((𝐼𝑉𝑥𝐴) → ({𝐼} × {𝑥}) ∈ V)
6 vex 3483 . . . . 5 𝑎 ∈ V
76rnex 7612 . . . 4 ran 𝑎 ∈ V
87uniex 7461 . . 3 ran 𝑎 ∈ V
98a1i 11 . 2 ((𝐼𝑉𝑎X𝑦 ∈ {𝐼}𝐴) → ran 𝑎 ∈ V)
10 sneq 4560 . . . . . 6 (𝑏 = 𝐼 → {𝑏} = {𝐼})
1110xpeq1d 5571 . . . . 5 (𝑏 = 𝐼 → ({𝑏} × {𝑥}) = ({𝐼} × {𝑥}))
1211eqeq2d 2835 . . . 4 (𝑏 = 𝐼 → (𝑎 = ({𝑏} × {𝑥}) ↔ 𝑎 = ({𝐼} × {𝑥})))
1312anbi2d 631 . . 3 (𝑏 = 𝐼 → ((𝑥𝐴𝑎 = ({𝑏} × {𝑥})) ↔ (𝑥𝐴𝑎 = ({𝐼} × {𝑥}))))
14 elixpsn 8497 . . . . . 6 (𝑏 ∈ V → (𝑎X𝑦 ∈ {𝑏}𝐴 ↔ ∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩}))
1514elv 3485 . . . . 5 (𝑎X𝑦 ∈ {𝑏}𝐴 ↔ ∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩})
1610ixpeq1d 8469 . . . . . 6 (𝑏 = 𝐼X𝑦 ∈ {𝑏}𝐴 = X𝑦 ∈ {𝐼}𝐴)
1716eleq2d 2901 . . . . 5 (𝑏 = 𝐼 → (𝑎X𝑦 ∈ {𝑏}𝐴𝑎X𝑦 ∈ {𝐼}𝐴))
1815, 17bitr3id 288 . . . 4 (𝑏 = 𝐼 → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ↔ 𝑎X𝑦 ∈ {𝐼}𝐴))
1918anbi1d 632 . . 3 (𝑏 = 𝐼 → ((∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎) ↔ (𝑎X𝑦 ∈ {𝐼}𝐴𝑥 = ran 𝑎)))
20 vex 3483 . . . . . . 7 𝑏 ∈ V
21 vex 3483 . . . . . . 7 𝑥 ∈ V
2220, 21xpsn 6894 . . . . . 6 ({𝑏} × {𝑥}) = {⟨𝑏, 𝑥⟩}
2322eqeq2i 2837 . . . . 5 (𝑎 = ({𝑏} × {𝑥}) ↔ 𝑎 = {⟨𝑏, 𝑥⟩})
2423anbi2i 625 . . . 4 ((𝑥𝐴𝑎 = ({𝑏} × {𝑥})) ↔ (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}))
25 eqid 2824 . . . . . . . . 9 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑥⟩}
26 opeq2 4789 . . . . . . . . . . 11 (𝑐 = 𝑥 → ⟨𝑏, 𝑐⟩ = ⟨𝑏, 𝑥⟩)
2726sneqd 4562 . . . . . . . . . 10 (𝑐 = 𝑥 → {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})
2827rspceeqv 3624 . . . . . . . . 9 ((𝑥𝐴 ∧ {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑥⟩}) → ∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩})
2925, 28mpan2 690 . . . . . . . 8 (𝑥𝐴 → ∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩})
3020, 21op2nda 6072 . . . . . . . . 9 ran {⟨𝑏, 𝑥⟩} = 𝑥
3130eqcomi 2833 . . . . . . . 8 𝑥 = ran {⟨𝑏, 𝑥⟩}
3229, 31jctir 524 . . . . . . 7 (𝑥𝐴 → (∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran {⟨𝑏, 𝑥⟩}))
33 eqeq1 2828 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑥⟩} → (𝑎 = {⟨𝑏, 𝑐⟩} ↔ {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩}))
3433rexbidv 3289 . . . . . . . 8 (𝑎 = {⟨𝑏, 𝑥⟩} → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ↔ ∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩}))
35 rneq 5793 . . . . . . . . . 10 (𝑎 = {⟨𝑏, 𝑥⟩} → ran 𝑎 = ran {⟨𝑏, 𝑥⟩})
3635unieqd 4838 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑥⟩} → ran 𝑎 = ran {⟨𝑏, 𝑥⟩})
3736eqeq2d 2835 . . . . . . . 8 (𝑎 = {⟨𝑏, 𝑥⟩} → (𝑥 = ran 𝑎𝑥 = ran {⟨𝑏, 𝑥⟩}))
3834, 37anbi12d 633 . . . . . . 7 (𝑎 = {⟨𝑏, 𝑥⟩} → ((∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎) ↔ (∃𝑐𝐴 {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran {⟨𝑏, 𝑥⟩})))
3932, 38syl5ibrcom 250 . . . . . 6 (𝑥𝐴 → (𝑎 = {⟨𝑏, 𝑥⟩} → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎)))
4039imp 410 . . . . 5 ((𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}) → (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎))
41 vex 3483 . . . . . . . . . . 11 𝑐 ∈ V
4220, 41op2nda 6072 . . . . . . . . . 10 ran {⟨𝑏, 𝑐⟩} = 𝑐
4342eqeq2i 2837 . . . . . . . . 9 (𝑥 = ran {⟨𝑏, 𝑐⟩} ↔ 𝑥 = 𝑐)
44 eqidd 2825 . . . . . . . . . . 11 (𝑐𝐴 → {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩})
4544ancli 552 . . . . . . . . . 10 (𝑐𝐴 → (𝑐𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩}))
46 eleq1w 2898 . . . . . . . . . . 11 (𝑥 = 𝑐 → (𝑥𝐴𝑐𝐴))
47 opeq2 4789 . . . . . . . . . . . . 13 (𝑥 = 𝑐 → ⟨𝑏, 𝑥⟩ = ⟨𝑏, 𝑐⟩)
4847sneqd 4562 . . . . . . . . . . . 12 (𝑥 = 𝑐 → {⟨𝑏, 𝑥⟩} = {⟨𝑏, 𝑐⟩})
4948eqeq2d 2835 . . . . . . . . . . 11 (𝑥 = 𝑐 → ({⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩} ↔ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩}))
5046, 49anbi12d 633 . . . . . . . . . 10 (𝑥 = 𝑐 → ((𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩}) ↔ (𝑐𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑐⟩})))
5145, 50syl5ibrcom 250 . . . . . . . . 9 (𝑐𝐴 → (𝑥 = 𝑐 → (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})))
5243, 51syl5bi 245 . . . . . . . 8 (𝑐𝐴 → (𝑥 = ran {⟨𝑏, 𝑐⟩} → (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})))
53 rneq 5793 . . . . . . . . . . 11 (𝑎 = {⟨𝑏, 𝑐⟩} → ran 𝑎 = ran {⟨𝑏, 𝑐⟩})
5453unieqd 4838 . . . . . . . . . 10 (𝑎 = {⟨𝑏, 𝑐⟩} → ran 𝑎 = ran {⟨𝑏, 𝑐⟩})
5554eqeq2d 2835 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑐⟩} → (𝑥 = ran 𝑎𝑥 = ran {⟨𝑏, 𝑐⟩}))
56 eqeq1 2828 . . . . . . . . . 10 (𝑎 = {⟨𝑏, 𝑐⟩} → (𝑎 = {⟨𝑏, 𝑥⟩} ↔ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩}))
5756anbi2d 631 . . . . . . . . 9 (𝑎 = {⟨𝑏, 𝑐⟩} → ((𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}) ↔ (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩})))
5855, 57imbi12d 348 . . . . . . . 8 (𝑎 = {⟨𝑏, 𝑐⟩} → ((𝑥 = ran 𝑎 → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩})) ↔ (𝑥 = ran {⟨𝑏, 𝑐⟩} → (𝑥𝐴 ∧ {⟨𝑏, 𝑐⟩} = {⟨𝑏, 𝑥⟩}))))
5952, 58syl5ibrcom 250 . . . . . . 7 (𝑐𝐴 → (𝑎 = {⟨𝑏, 𝑐⟩} → (𝑥 = ran 𝑎 → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}))))
6059rexlimiv 3272 . . . . . 6 (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} → (𝑥 = ran 𝑎 → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩})))
6160imp 410 . . . . 5 ((∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎) → (𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}))
6240, 61impbii 212 . . . 4 ((𝑥𝐴𝑎 = {⟨𝑏, 𝑥⟩}) ↔ (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎))
6324, 62bitri 278 . . 3 ((𝑥𝐴𝑎 = ({𝑏} × {𝑥})) ↔ (∃𝑐𝐴 𝑎 = {⟨𝑏, 𝑐⟩} ∧ 𝑥 = ran 𝑎))
6413, 19, 63vtoclbg 3555 . 2 (𝐼𝑉 → ((𝑥𝐴𝑎 = ({𝐼} × {𝑥})) ↔ (𝑎X𝑦 ∈ {𝐼}𝐴𝑥 = ran 𝑎)))
651, 5, 9, 64f1od 7391 1 (𝐼𝑉𝐹:𝐴1-1-ontoX𝑦 ∈ {𝐼}𝐴)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115  ∃wrex 3134  Vcvv 3480  {csn 4550  ⟨cop 4556  ∪ cuni 4824   ↦ cmpt 5132   × cxp 5540  ran crn 5543  –1-1-onto→wf1o 6342  Xcixp 8457 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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5189  ax-nul 5196  ax-pow 5253  ax-pr 5317  ax-un 7455 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rab 3142  df-v 3482  df-sbc 3759  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4277  df-if 4451  df-pw 4524  df-sn 4551  df-pr 4553  df-op 4557  df-uni 4825  df-br 5053  df-opab 5115  df-mpt 5133  df-id 5447  df-xp 5548  df-rel 5549  df-cnv 5550  df-co 5551  df-dm 5552  df-rn 5553  df-res 5554  df-ima 5555  df-iota 6302  df-fun 6345  df-fn 6346  df-f 6347  df-f1 6348  df-fo 6349  df-f1o 6350  df-fv 6351  df-ixp 8458 This theorem is referenced by:  mapsnf1o  8499
 Copyright terms: Public domain W3C validator