Theorem bj-2uplth 35211

Description: The characteristic property of couples. Note that this holds without sethood hypotheses (compare opth 5391). (Contributed by BJ, 6-Oct-2018.)

Assertion

Ref	Expression
bj-2uplth	⊢ (⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

Proof of Theorem bj-2uplth

Step	Hyp	Ref	Expression
1		bj-pr1eq 35192	. . . 4 ⊢ (⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆ → pr1 ⦅𝐴, 𝐵⦆ = pr1 ⦅𝐶, 𝐷⦆)
2		bj-pr21val 35203	. . . 4 ⊢ pr1 ⦅𝐴, 𝐵⦆ = 𝐴
3		bj-pr21val 35203	. . . 4 ⊢ pr1 ⦅𝐶, 𝐷⦆ = 𝐶
4	1, 2, 3	3eqtr3g 2801	. . 3 ⊢ (⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆ → 𝐴 = 𝐶)
5		bj-pr2eq 35206	. . . 4 ⊢ (⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆ → pr2 ⦅𝐴, 𝐵⦆ = pr2 ⦅𝐶, 𝐷⦆)
6		bj-pr22val 35209	. . . 4 ⊢ pr2 ⦅𝐴, 𝐵⦆ = 𝐵
7		bj-pr22val 35209	. . . 4 ⊢ pr2 ⦅𝐶, 𝐷⦆ = 𝐷
8	5, 6, 7	3eqtr3g 2801	. . 3 ⊢ (⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆ → 𝐵 = 𝐷)
9	4, 8	jca 512	. 2 ⊢ (⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆ → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
10		bj-2upleq 35202	. . 3 ⊢ (𝐴 = 𝐶 → (𝐵 = 𝐷 → ⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆))
11	10	imp 407	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆)
12	9, 11	impbii 208	1 ⊢ (⦅𝐴, 𝐵⦆ = ⦅𝐶, 𝐷⦆ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

Syntax hints:   ↔ wb 205   ∧ wa 396   = wceq 1539  pr₁ bj-cpr1 35190  ⦅bj-c2uple 35200  pr₂ bj-cpr2 35204

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-suc 6272  df-1o 8297  df-bj-sngl 35156  df-bj-tag 35165  df-bj-proj 35181  df-bj-1upl 35188  df-bj-pr1 35191  df-bj-2upl 35201  df-bj-pr2 35205

This theorem is referenced by: (None)