Theorem bj-projval 38001

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 4594	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵))
2		bj-xpima2sn 37963	. . . . . . . . 9 ⊢ (𝐴 ∈ {𝐵} → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶)
3	1, 2	biimtrrdi 257	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶))
4	3	imp 412	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶)
5	4	eleq2d 2846	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → ({𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}) ↔ {𝑥} ∈ tag 𝐶))
6	5	abbidv 2826	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → {𝑥 ∣ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴})} = {𝑥 ∣ {𝑥} ∈ tag 𝐶})
7		df-bj-proj 37996	. . . . 5 ⊢ (𝐴 Proj ({𝐵} × tag 𝐶)) = {𝑥 ∣ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴})}
8		bj-taginv 37991	. . . . 5 ⊢ 𝐶 = {𝑥 ∣ {𝑥} ∈ tag 𝐶}
9	6, 7, 8	3eqtr4g 2820	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶)
10	9	ex 418	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶))
11		noel 4283	. . . . 5 ⊢ ¬ {𝑥} ∈ ∅
12	7	eqabri 2902	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)) ↔ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}))
13		elsni 4597	. . . . . . . 8 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)
14		bj-xpima1sn 37961	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ {𝐵} → (({𝐵} × tag 𝐶) “ {𝐴}) = ∅)
15	13, 14	nsyl5 160	. . . . . . 7 ⊢ (¬ 𝐴 = 𝐵 → (({𝐵} × tag 𝐶) “ {𝐴}) = ∅)
16	15	eleq2d 2846	. . . . . 6 ⊢ (¬ 𝐴 = 𝐵 → ({𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}) ↔ {𝑥} ∈ ∅))
17	12, 16	bitrid 286	. . . . 5 ⊢ (¬ 𝐴 = 𝐵 → (𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)) ↔ {𝑥} ∈ ∅))
18	11, 17	mtbiri 330	. . . 4 ⊢ (¬ 𝐴 = 𝐵 → ¬ 𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)))
19	18	eq0rdv 4364	. . 3 ⊢ (¬ 𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = ∅)
20		ifval 4524	. . 3 ⊢ ((𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐴 = 𝐵, 𝐶, ∅) ↔ ((𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶) ∧ (¬ 𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = ∅)))
21	10, 19, 20	sylanblrc 602	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐴 = 𝐵, 𝐶, ∅))
22		eqcom 2767	. . 3 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴)
23		ifbi 4504	. . 3 ⊢ ((𝐴 = 𝐵 ↔ 𝐵 = 𝐴) → if(𝐴 = 𝐵, 𝐶, ∅) = if(𝐵 = 𝐴, 𝐶, ∅))
24	22, 23	ax-mp 5	. 2 ⊢ if(𝐴 = 𝐵, 𝐶, ∅) = if(𝐵 = 𝐴, 𝐶, ∅)
25	21, 24	eqtrdi 2811	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐵 = 𝐴, 𝐶, ∅))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∅c0 4278  ifcif 4481  {csn 4584   × cxp 5648   “ cima 5653  tag bj-ctag 37979   Proj bj-cproj 37995

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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-bj-sngl 37971  df-bj-tag 37980  df-bj-proj 37996

This theorem is used by:  bj-pr1val  38009  bj-pr2val  38023