Theorem eqrelrel 5790

Description: Extensionality principle for ordered triples (used by 2-place operations df-oprab 7408), analogous to eqrel 5777. Use relrelss 6265 to express the antecedent in terms of the relation predicate. (Contributed by NM, 17-Dec-2008.)

Assertion

Ref	Expression
eqrelrel	⊢ ((𝐴 ∪ 𝐵) ⊆ ((V × V) × V) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧

Proof of Theorem eqrelrel

Step	Hyp	Ref	Expression
1		unss 4179	. 2 ⊢ ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) ↔ (𝐴 ∪ 𝐵) ⊆ ((V × V) × V))
2		ssrelrel 5789	. . . 4 ⊢ (𝐴 ⊆ ((V × V) × V) → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
3		ssrelrel 5789	. . . 4 ⊢ (𝐵 ⊆ ((V × V) × V) → (𝐵 ⊆ 𝐴 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
4	2, 3	bi2anan9 636	. . 3 ⊢ ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴))))
5		eqss 3992	. . 3 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
6		2albiim 1885	. . . . 5 ⊢ (∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ (∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
7	6	albii 1813	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ ∀𝑥(∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
8		19.26 1865	. . . 4 ⊢ (∀𝑥(∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
9	7, 8	bitri 275	. . 3 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
10	4, 5, 9	3bitr4g 314	. 2 ⊢ ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
11	1, 10	sylbir 234	1 ⊢ ((𝐴 ∪ 𝐵) ⊆ ((V × V) × V) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  ∀wal 1531   = wceq 1533   ∈ wcel 2098  Vcvv 3468   ∪ cun 3941   ⊆ wss 3943  ⟨cop 4629   × cxp 5667

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-11 2146  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-opab 5204  df-xp 5675

This theorem is referenced by: (None)