Theorem djulf1o 10003

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-1-onto→({∅} × V)

Proof of Theorem djulf1o

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-inl 9993	. . 3 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
2		0ex 5263	. . . . . 6 ⊢ ∅ ∈ V
3	2	snid 4622	. . . . 5 ⊢ ∅ ∈ {∅}
4		opelxpi 5691	. . . . 5 ⊢ ((∅ ∈ {∅} ∧ 𝑥 ∈ V) → ⟨∅, 𝑥⟩ ∈ ({∅} × V))
5	3, 4	mpan 703	. . . 4 ⊢ (𝑥 ∈ V → ⟨∅, 𝑥⟩ ∈ ({∅} × V))
6	5	adantl 487	. . 3 ⊢ ((⊤ ∧ 𝑥 ∈ V) → ⟨∅, 𝑥⟩ ∈ ({∅} × V))
7		fvexd 6908	. . 3 ⊢ ((⊤ ∧ 𝑦 ∈ ({∅} × V)) → (2nd ‘𝑦) ∈ V)
8		1st2nd2 8047	. . . . . . . 8 ⊢ (𝑦 ∈ ({∅} × V) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
9		xp1st 8040	. . . . . . . . . 10 ⊢ (𝑦 ∈ ({∅} × V) → (1st ‘𝑦) ∈ {∅})
10		elsni 4600	. . . . . . . . . 10 ⊢ ((1st ‘𝑦) ∈ {∅} → (1st ‘𝑦) = ∅)
11	9, 10	syl 18	. . . . . . . . 9 ⊢ (𝑦 ∈ ({∅} × V) → (1st ‘𝑦) = ∅)
12	11	opeq1d 4848	. . . . . . . 8 ⊢ (𝑦 ∈ ({∅} × V) → ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨∅, (2nd ‘𝑦)⟩)
13	8, 12	eqtrd 2798	. . . . . . 7 ⊢ (𝑦 ∈ ({∅} × V) → 𝑦 = ⟨∅, (2nd ‘𝑦)⟩)
14	13	eqeq2d 2774	. . . . . 6 ⊢ (𝑦 ∈ ({∅} × V) → (⟨∅, 𝑥⟩ = 𝑦 ↔ ⟨∅, 𝑥⟩ = ⟨∅, (2nd ‘𝑦)⟩))
15		eqcom 2770	. . . . . 6 ⊢ (⟨∅, 𝑥⟩ = 𝑦 ↔ 𝑦 = ⟨∅, 𝑥⟩)
16		eqid 2763	. . . . . . 7 ⊢ ∅ = ∅
17		vex 3457	. . . . . . . 8 ⊢ 𝑥 ∈ V
18	2, 17	opth 5448	. . . . . . 7 ⊢ (⟨∅, 𝑥⟩ = ⟨∅, (2nd ‘𝑦)⟩ ↔ (∅ = ∅ ∧ 𝑥 = (2nd ‘𝑦)))
19	16, 18	mpbiran 722	. . . . . 6 ⊢ (⟨∅, 𝑥⟩ = ⟨∅, (2nd ‘𝑦)⟩ ↔ 𝑥 = (2nd ‘𝑦))
20	14, 15, 19	3bitr3g 316	. . . . 5 ⊢ (𝑦 ∈ ({∅} × V) → (𝑦 = ⟨∅, 𝑥⟩ ↔ 𝑥 = (2nd ‘𝑦)))
21	20	bicomd 226	. . . 4 ⊢ (𝑦 ∈ ({∅} × V) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = ⟨∅, 𝑥⟩))
22	21	ad2antll 742	. . 3 ⊢ ((⊤ ∧ (𝑥 ∈ V ∧ 𝑦 ∈ ({∅} × V))) → (𝑥 = (2nd ‘𝑦) ↔ 𝑦 = ⟨∅, 𝑥⟩))
23	1, 6, 7, 22	f1o2d 7682	. 2 ⊢ (⊤ → inl:V–1-1-onto→({∅} × V))
24	23	mptru 1576	1 ⊢ inl:V–1-1-onto→({∅} × V)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ⊤wtru 1570   ∈ wcel 2146  Vcvv 3453  ∅c0 4280  {csn 4587  ⟨cop 4837   × cxp 5652  –1-1-onto→wf1o 6545  ‘cfv 6546  1^st c1st 8006  2^nd c2nd 8007  inlcinl 9990

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-1st 8008  df-2nd 8009  df-inl 9993

This theorem is used by:  inlresf  10005  inlresf1  10006  djuin  10009  djuun  10017