Theorem inlresf 10008

Description: The left injection restricted to the left class of a disjoint union is a function from the left class into the disjoint union. (Contributed by AV, 27-Jun-2022.)

Assertion

Ref	Expression
inlresf	⊢ (inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵)

Proof of Theorem inlresf

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		djulf1o 10006	. . 3 ⊢ inl:V–1-1-onto→({∅} × V)
2		f1ofun 6837	. . 3 ⊢ (inl:V–1-1-onto→({∅} × V) → Fun inl)
3		ffvresb 7137	. . 3 ⊢ (Fun inl → ((inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵) ↔ ∀𝑥 ∈ 𝐴 (𝑥 ∈ dom inl ∧ (inl‘𝑥) ∈ (𝐴 ⊔ 𝐵))))
4	1, 2, 3	mp2b 10	. 2 ⊢ ((inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵) ↔ ∀𝑥 ∈ 𝐴 (𝑥 ∈ dom inl ∧ (inl‘𝑥) ∈ (𝐴 ⊔ 𝐵)))
5		elex 3475	. . . 4 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ V)
6		opex 5436	. . . . 5 ⊢ ⟨∅, 𝑥⟩ ∈ V
7		df-inl 9996	. . . . 5 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
8	6, 7	dmmpti 6694	. . . 4 ⊢ dom inl = V
9	5, 8	eleqtrrdi 2875	. . 3 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ dom inl)
10		djulcl 10004	. . 3 ⊢ (𝑥 ∈ 𝐴 → (inl‘𝑥) ∈ (𝐴 ⊔ 𝐵))
11	9, 10	jca 521	. 2 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ dom inl ∧ (inl‘𝑥) ∈ (𝐴 ⊔ 𝐵)))
12	4, 11	mprgbir 3087	1 ⊢ (inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∈ wcel 2146  ∀wral 3080  Vcvv 3454  ∅c0 4281  {csn 4588  ⟨cop 4838   × cxp 5653  dom cdm 5655   ↾ cres 5657  Fun wfun 6541  ⟶wf 6543  –1-1-onto→wf1o 6546  ‘cfv 6547   ⊔ cdju 9992  inlcinl 9993

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 5252  ax-nul 5263  ax-pr 5395  ax-un 7761

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 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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-1st 8011  df-2nd 8012  df-dju 9995  df-inl 9996

This theorem is used by:  inlresf1  10009  updjudhcoinlf  10026  updjud  10028