Theorem bj-2upleq 35888

Description: Substitution property for ⦅ − , − ⦆. (Contributed by BJ, 6-Oct-2018.)

Assertion

Ref	Expression
bj-2upleq	⊢ (𝐴 = 𝐵 → (𝐶 = 𝐷 → ⦅𝐴, 𝐶⦆ = ⦅𝐵, 𝐷⦆))

Proof of Theorem bj-2upleq

Step	Hyp	Ref	Expression
1		bj-1upleq 35875	. . 3 ⊢ (𝐴 = 𝐵 → ⦅𝐴⦆ = ⦅𝐵⦆)
2		bj-xtageq 35864	. . 3 ⊢ (𝐶 = 𝐷 → ({1o} × tag 𝐶) = ({1o} × tag 𝐷))
3		uneq12 4158	. . . 4 ⊢ ((⦅𝐴⦆ = ⦅𝐵⦆ ∧ ({1o} × tag 𝐶) = ({1o} × tag 𝐷)) → (⦅𝐴⦆ ∪ ({1o} × tag 𝐶)) = (⦅𝐵⦆ ∪ ({1o} × tag 𝐷)))
4	3	ex 413	. . 3 ⊢ (⦅𝐴⦆ = ⦅𝐵⦆ → (({1o} × tag 𝐶) = ({1o} × tag 𝐷) → (⦅𝐴⦆ ∪ ({1o} × tag 𝐶)) = (⦅𝐵⦆ ∪ ({1o} × tag 𝐷))))
5	1, 2, 4	syl2im 40	. 2 ⊢ (𝐴 = 𝐵 → (𝐶 = 𝐷 → (⦅𝐴⦆ ∪ ({1o} × tag 𝐶)) = (⦅𝐵⦆ ∪ ({1o} × tag 𝐷))))
6		df-bj-2upl 35887	. . 3 ⊢ ⦅𝐴, 𝐶⦆ = (⦅𝐴⦆ ∪ ({1o} × tag 𝐶))
7		df-bj-2upl 35887	. . 3 ⊢ ⦅𝐵, 𝐷⦆ = (⦅𝐵⦆ ∪ ({1o} × tag 𝐷))
8	6, 7	eqeq12i 2750	. 2 ⊢ (⦅𝐴, 𝐶⦆ = ⦅𝐵, 𝐷⦆ ↔ (⦅𝐴⦆ ∪ ({1o} × tag 𝐶)) = (⦅𝐵⦆ ∪ ({1o} × tag 𝐷)))
9	5, 8	syl6ibr 251	1 ⊢ (𝐴 = 𝐵 → (𝐶 = 𝐷 → ⦅𝐴, 𝐶⦆ = ⦅𝐵, 𝐷⦆))

Syntax hints:   → wi 4   = wceq 1541   ∪ cun 3946  {csn 4628   × cxp 5674  1_oc1o 8458  tag bj-ctag 35850  ⦅bj-c1upl 35873  ⦅bj-c2uple 35886

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-rex 3071  df-v 3476  df-un 3953  df-opab 5211  df-xp 5682  df-bj-sngl 35842  df-bj-tag 35851  df-bj-1upl 35874  df-bj-2upl 35887

This theorem is referenced by:  bj-2uplth  35897