Theorem 1stinl 9935

Description: The first component of the value of a left injection is the empty set. (Contributed by AV, 27-Jun-2022.)

Assertion

Ref	Expression
1stinl	⊢ (𝑋 ∈ 𝑉 → (1st ‘(inl‘𝑋)) = ∅)

Proof of Theorem 1stinl

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-inl 9910	. . . 4 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
2		opeq2 4834	. . . 4 ⊢ (𝑥 = 𝑋 → ⟨∅, 𝑥⟩ = ⟨∅, 𝑋⟩)
3		elex 3471	. . . 4 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V)
4		opex 5439	. . . . 5 ⊢ ⟨∅, 𝑋⟩ ∈ V
5	4	a1i 11	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ⟨∅, 𝑋⟩ ∈ V)
6	1, 2, 3, 5	fvmptd3 7011	. . 3 ⊢ (𝑋 ∈ 𝑉 → (inl‘𝑋) = ⟨∅, 𝑋⟩)
7	6	fveq2d 6883	. 2 ⊢ (𝑋 ∈ 𝑉 → (1st ‘(inl‘𝑋)) = (1st ‘⟨∅, 𝑋⟩))
8		0ex 5264	. . 3 ⊢ ∅ ∈ V
9		op1stg 7999	. . 3 ⊢ ((∅ ∈ V ∧ 𝑋 ∈ 𝑉) → (1st ‘⟨∅, 𝑋⟩) = ∅)
10	8, 9	mpan 703	. 2 ⊢ (𝑋 ∈ 𝑉 → (1st ‘⟨∅, 𝑋⟩) = ∅)
11	7, 10	eqtrd 2795	1 ⊢ (𝑋 ∈ 𝑉 → (1st ‘(inl‘𝑋)) = ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ∅c0 4279  ⟨cop 4590  ‘cfv 6533  1^st c1st 7985  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  ax-un 7737

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-ne 2956  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-rn 5666  df-iota 6489  df-fun 6535  df-fv 6541  df-1st 7987  df-inl 9910

This theorem is used by:  updjudhcoinlf  9940