Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-projval Structured version   Visualization version   GIF version

Theorem bj-projval 33109
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.
StepHypRef Expression
1 elsng 4224 . . . . . . . . 9 (𝐴𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵))
2 bj-xpima2sn 33070 . . . . . . . . 9 (𝐴 ∈ {𝐵} → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶)
31, 2syl6bir 244 . . . . . . . 8 (𝐴𝑉 → (𝐴 = 𝐵 → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶))
43imp 444 . . . . . . 7 ((𝐴𝑉𝐴 = 𝐵) → (({𝐵} × tag 𝐶) “ {𝐴}) = tag 𝐶)
54eleq2d 2716 . . . . . 6 ((𝐴𝑉𝐴 = 𝐵) → ({𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}) ↔ {𝑥} ∈ tag 𝐶))
65abbidv 2770 . . . . 5 ((𝐴𝑉𝐴 = 𝐵) → {𝑥 ∣ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴})} = {𝑥 ∣ {𝑥} ∈ tag 𝐶})
7 df-bj-proj 33104 . . . . 5 (𝐴 Proj ({𝐵} × tag 𝐶)) = {𝑥 ∣ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴})}
8 bj-taginv 33099 . . . . 5 𝐶 = {𝑥 ∣ {𝑥} ∈ tag 𝐶}
96, 7, 83eqtr4g 2710 . . . 4 ((𝐴𝑉𝐴 = 𝐵) → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶)
109ex 449 . . 3 (𝐴𝑉 → (𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶))
11 noel 3952 . . . . 5 ¬ {𝑥} ∈ ∅
127abeq2i 2764 . . . . . 6 (𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)) ↔ {𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}))
13 elsni 4227 . . . . . . . . . 10 (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)
1413con3i 150 . . . . . . . . 9 𝐴 = 𝐵 → ¬ 𝐴 ∈ {𝐵})
15 df-nel 2927 . . . . . . . . 9 (𝐴 ∉ {𝐵} ↔ ¬ 𝐴 ∈ {𝐵})
1614, 15sylibr 224 . . . . . . . 8 𝐴 = 𝐵𝐴 ∉ {𝐵})
17 bj-xpima1sn 33068 . . . . . . . 8 (𝐴 ∉ {𝐵} → (({𝐵} × tag 𝐶) “ {𝐴}) = ∅)
1816, 17syl 17 . . . . . . 7 𝐴 = 𝐵 → (({𝐵} × tag 𝐶) “ {𝐴}) = ∅)
1918eleq2d 2716 . . . . . 6 𝐴 = 𝐵 → ({𝑥} ∈ (({𝐵} × tag 𝐶) “ {𝐴}) ↔ {𝑥} ∈ ∅))
2012, 19syl5bb 272 . . . . 5 𝐴 = 𝐵 → (𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)) ↔ {𝑥} ∈ ∅))
2111, 20mtbiri 316 . . . 4 𝐴 = 𝐵 → ¬ 𝑥 ∈ (𝐴 Proj ({𝐵} × tag 𝐶)))
2221eq0rdv 4012 . . 3 𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = ∅)
23 ifval 4160 . . 3 ((𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐴 = 𝐵, 𝐶, ∅) ↔ ((𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = 𝐶) ∧ (¬ 𝐴 = 𝐵 → (𝐴 Proj ({𝐵} × tag 𝐶)) = ∅)))
2410, 22, 23sylanblrc 698 . 2 (𝐴𝑉 → (𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐴 = 𝐵, 𝐶, ∅))
25 eqcom 2658 . . 3 (𝐴 = 𝐵𝐵 = 𝐴)
26 ifbi 4140 . . 3 ((𝐴 = 𝐵𝐵 = 𝐴) → if(𝐴 = 𝐵, 𝐶, ∅) = if(𝐵 = 𝐴, 𝐶, ∅))
2725, 26ax-mp 5 . 2 if(𝐴 = 𝐵, 𝐶, ∅) = if(𝐵 = 𝐴, 𝐶, ∅)
2824, 27syl6eq 2701 1 (𝐴𝑉 → (𝐴 Proj ({𝐵} × tag 𝐶)) = if(𝐵 = 𝐴, 𝐶, ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383   = wceq 1523  wcel 2030  {cab 2637  wnel 2926  c0 3948  ifcif 4119  {csn 4210   × cxp 5141  cima 5146  tag bj-ctag 33087   Proj bj-cproj 33103
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-br 4686  df-opab 4746  df-xp 5149  df-rel 5150  df-cnv 5151  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-bj-sngl 33079  df-bj-tag 33088  df-bj-proj 33104
This theorem is referenced by:  bj-pr1val  33117  bj-pr2val  33131
  Copyright terms: Public domain W3C validator