Theorem djulcl 9912

Description: Left closure of disjoint union. (Contributed by Jim Kingdon, 21-Jun-2022.)

Assertion

Ref	Expression
djulcl	⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) ∈ (𝐴 ⊔ 𝐵))

Proof of Theorem djulcl

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-inl 9904	. . 3 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
2		opeq2 4841	. . 3 ⊢ (𝑥 = 𝐶 → ⟨∅, 𝑥⟩ = ⟨∅, 𝐶⟩)
3		elex 3478	. . 3 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ V)
4		0ex 5272	. . . . 5 ⊢ ∅ ∈ V
5	4	snid 4630	. . . 4 ⊢ ∅ ∈ {∅}
6		opelxpi 5700	. . . 4 ⊢ ((∅ ∈ {∅} ∧ 𝐶 ∈ 𝐴) → ⟨∅, 𝐶⟩ ∈ ({∅} × 𝐴))
7	5, 6	mpan 703	. . 3 ⊢ (𝐶 ∈ 𝐴 → ⟨∅, 𝐶⟩ ∈ ({∅} × 𝐴))
8	1, 2, 3, 7	fvmptd3 7017	. 2 ⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) = ⟨∅, 𝐶⟩)
9		elun1 4135	. . . 4 ⊢ (⟨∅, 𝐶⟩ ∈ ({∅} × 𝐴) → ⟨∅, 𝐶⟩ ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
10	7, 9	syl 18	. . 3 ⊢ (𝐶 ∈ 𝐴 → ⟨∅, 𝐶⟩ ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
11		df-dju 9903	. . 3 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
12	10, 11	eleqtrrdi 2876	. 2 ⊢ (𝐶 ∈ 𝐴 → ⟨∅, 𝐶⟩ ∈ (𝐴 ⊔ 𝐵))
13	8, 12	eqeltrd 2865	1 ⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) ∈ (𝐴 ⊔ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146  Vcvv 3457   ∪ cun 3904  ∅c0 4286  {csn 4591  ⟨cop 4597   × cxp 5661  ‘cfv 6540  1_oc1o 8452   ⊔ cdju 9900  inlcinl 9901

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-dju 9903  df-inl 9904

This theorem is used by:  inlresf  9916  updjudhcoinlf  9934