Theorem bj-projval 37879

Description: Value of the class projection. (Contributed by BJ, 6-Apr-2019.)

Assertion

Ref	Expression
bj-projval	⊢ (𝐴 ∈ 𝑉 → (𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐵 = 𝐴, 𝐶, ∅))

Proof of Theorem bj-projval

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elsng 4598	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵))
2		bj-xpima2sn 37841	. . . . . . . . 9 ⊢ (𝐴 ∈ {𝐵} → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶)
3	1, 2	biimtrrdi 257	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶))
4	3	imp 412	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶)
5	4	eleq2d 2847	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → ({𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}) ↔ {𝑥} ∈ tag 𝐶))
6	5	abbidv 2827	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → {𝑥 ∣ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴})} = {𝑥 ∣ {𝑥} ∈ tag 𝐶})
7		df-bj-proj 37874	. . . . 5 ⊢ (𝐴 Proj ({𝐵} × tag 𝐶)) = {𝑥 ∣ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴})}
8		bj-taginv 37869	. . . . 5 ⊢ 𝐶 = {𝑥 ∣ {𝑥} ∈ tag 𝐶}
9	6, 7, 8	3eqtr4g 2821	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶)
10	9	ex 418	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶))
11		noel 4284	. . . . 5 ⊢ ¬ {𝑥} ∈ ∅
12	7	eqabri 2903	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)) ↔ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}))
13		elsni 4601	. . . . . . . 8 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)
14		bj-xpima1sn 37839	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ {𝐵} → (({𝐵} × tag 𝐶) “ {𝐴}) = ∅)
15	13, 14	nsyl5 160	. . . . . . 7 ⊢ (¬ 𝐴 = 𝐵 → (({𝐵} × tag 𝐶) “ {𝐴}) = ∅)
16	15	eleq2d 2847	. . . . . 6 ⊢ (¬ 𝐴 = 𝐵 → ({𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}) ↔ {𝑥} ∈ ∅))
17	12, 16	bitrid 286	. . . . 5 ⊢ (¬ 𝐴 = 𝐵 → (𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)) ↔ {𝑥} ∈ ∅))
18	11, 17	mtbiri 330	. . . 4 ⊢ (¬ 𝐴 = 𝐵 → ¬ 𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)))
19	18	eq0rdv 4365	. . 3 ⊢ (¬ 𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = ∅)
20		ifval 4525	. . 3 ⊢ ((𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐴 = 𝐵, 𝐶, ∅) ↔ ((𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶) ∧ (¬ 𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = ∅)))
21	10, 19, 20	sylanblrc 602	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐴 = 𝐵, 𝐶, ∅))
22		eqcom 2768	. . 3 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴)
23		ifbi 4505	. . 3 ⊢ ((𝐴 = 𝐵 ↔ 𝐵 = 𝐴) → if(𝐴 = 𝐵, 𝐶, ∅) = if(𝐵 = 𝐴, 𝐶, ∅))
24	22, 23	ax-mp 5	. 2 ⊢ if(𝐴 = 𝐵, 𝐶, ∅) = if(𝐵 = 𝐴, 𝐶, ∅)
25	21, 24	eqtrdi 2812	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐵 = 𝐴, 𝐶, ∅))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∅c0 4279  ifcif 4482  {csn 4584   × cxp 5649   “ cima 5654  tag bj-ctag 37857   Proj bj-cproj 37873

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-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-bj-sngl 37849  df-bj-tag 37858  df-bj-proj 37874

This theorem is used by:  bj-pr1val  37887  bj-pr2val  37901