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

Theorem djulf1o 10030
Description: The left injection function on all sets is one to one and onto. (Contributed by Jim Kingdon, 22-Jun-2022.)
Assertion
Ref Expression
djulf1o inl:V⟶1-1onto({∅} × V)

Proof of Theorem djulf1o
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-inl 10020 . . 3 inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
2 0ex 5267 . . . . . 6 ∅ ∈ V
32snid 4624 . . . . 5 ∅ ∈ {∅}
4 opelxpi 5695 . . . . 5 ((∅ ∈ {∅} ∧ 𝑥 ∈ V) → ⟨∅, 𝑥⟩ ∈ ({∅} × V))
53, 4mpan 703 . . . 4 (𝑥 ∈ V → ⟨∅, 𝑥⟩ ∈ ({∅} × V))
65adantl 487 . . 3 ((⊤ ∧ 𝑥 ∈ V) → ⟨∅, 𝑥⟩ ∈ ({∅} × V))
7 fvexd 6931 . . 3 ((⊤ ∧ 𝑦 ∈ ({∅} × V)) → (2nd ‘𝑦) ∈ V)
8 1st2nd2 8074 . . . . . . . 8 (𝑦 ∈ ({∅} × V) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
9 xp1st 8067 . . . . . . . . . 10 (𝑦 ∈ ({∅} × V) → (1st ‘𝑦) ∈ {∅})
10 elsni 4601 . . . . . . . . . 10 ((1st ‘𝑦) ∈ {∅} → (1st ‘𝑦) = ∅)
119, 10syl 18 . . . . . . . . 9 (𝑦 ∈ ({∅} × V) → (1st ‘𝑦) = ∅)
1211opeq1d 4851 . . . . . . . 8 (𝑦 ∈ ({∅} × V) → ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨∅, (2nd ‘𝑦)⟩)
138, 12eqtrd 2798 . . . . . . 7 (𝑦 ∈ ({∅} × V) → 𝑦 = ⟨∅, (2nd ‘𝑦)⟩)
1413eqeq2d 2774 . . . . . 6 (𝑦 ∈ ({∅} × V) → (⟨∅, 𝑥⟩ = 𝑦 ↔ ⟨∅, 𝑥⟩ = ⟨∅, (2nd ‘𝑦)⟩))
15 eqcom 2770 . . . . . 6 (⟨∅, 𝑥⟩ = 𝑦 ↔ 𝑦 = ⟨∅, 𝑥⟩)
16 eqid 2763 . . . . . . 7 ∅ = ∅
17 vex 3458 . . . . . . . 8 𝑥 ∈ V
182, 17opth 5452 . . . . . . 7 (⟨∅, 𝑥⟩ = ⟨∅, (2nd ‘𝑦)⟩ ↔ (∅ = ∅ ∧ 𝑥 = (2nd ‘𝑦)))
1916, 18mpbiran 722 . . . . . 6 (⟨∅, 𝑥⟩ = ⟨∅, (2nd ‘𝑦)⟩ ↔ 𝑥 = (2nd ‘𝑦))
2014, 15, 193bitr3g 316 . . . . 5 (𝑦 ∈ ({∅} × V) → (𝑦 = ⟨∅, 𝑥⟩ ↔ 𝑥 = (2nd ‘𝑦)))
2120bicomd 226 . . . 4 (𝑦 ∈ ({∅} × V) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = ⟨∅, 𝑥⟩))
2221ad2antll 742 . . 3 ((⊤ ∧ (𝑥 ∈ V ∧ 𝑦 ∈ ({∅} × V))) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = ⟨∅, 𝑥⟩))
231, 6, 7, 22f1o2d 7707 . 2 (⊤ → inl:V⟶1-1onto({∅} × V))
2423mptru 1577 1 inl:V⟶1-1onto({∅} × V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ⊤wtru 1571   ∈ wcel 2147  Vcvv 3454  ∅c0 4281  {csn 4588  ⟨cop 4840   × cxp 5656  ⟶1-1ontowf1o 6565  ‘cfv 6566  1st c1st 8033  2nd c2nd 8034  inlcinl 10017
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-1st 8035  df-2nd 8036  df-inl 10020
This theorem is used by:  inlresf  10032  inlresf1  10033  djuin  10036  djuun  10044
  Copyright terms: Public domain W3C validator