Theorem djulcl 9918

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 9910	. . 3 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
2		opeq2 4834	. . 3 ⊢ (𝑥 = 𝐶 → ⟨∅, 𝑥⟩ = ⟨∅, 𝐶⟩)
3		elex 3471	. . 3 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ V)
4		0ex 5264	. . . . 5 ⊢ ∅ ∈ V
5	4	snid 4623	. . . 4 ⊢ ∅ ∈ {∅}
6		opelxpi 5692	. . . 4 ⊢ ((∅ ∈ {∅} ∧ 𝐶 ∈ 𝐴) → ⟨∅, 𝐶⟩ ∈ ({∅} × 𝐴))
7	5, 6	mpan 703	. . 3 ⊢ (𝐶 ∈ 𝐴 → ⟨∅, 𝐶⟩ ∈ ({∅} × 𝐴))
8	1, 2, 3, 7	fvmptd3 7011	. 2 ⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) = ⟨∅, 𝐶⟩)
9		elun1 4128	. . . 4 ⊢ (⟨∅, 𝐶⟩ ∈ ({∅} × 𝐴) → ⟨∅, 𝐶⟩ ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
10	7, 9	syl 18	. . 3 ⊢ (𝐶 ∈ 𝐴 → ⟨∅, 𝐶⟩ ∈ (({∅} × 𝐴) ∪ ({1o} × 𝐵)))
11		df-dju 9909	. . 3 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵))
12	10, 11	eleqtrrdi 2871	. 2 ⊢ (𝐶 ∈ 𝐴 → ⟨∅, 𝐶⟩ ∈ (𝐴 ⊔ 𝐵))
13	8, 12	eqeltrd 2860	1 ⊢ (𝐶 ∈ 𝐴 → (inl‘𝐶) ∈ (𝐴 ⊔ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  Vcvv 3450   ∪ cun 3897  ∅c0 4279  {csn 4584  ⟨cop 4590   × cxp 5653  ‘cfv 6533  1_oc1o 8451   ⊔ cdju 9906  inlcinl 9907

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-dju 9909  df-inl 9910

This theorem is used by:  inlresf  9922  updjudhcoinlf  9940