Theorem eqrelrel 5737

Description: Extensionality principle for ordered triples (used by 2-place operations df-oprab 7350), analogous to eqrel 5724. Use relrelss 6220 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 4140	. 2 ⊢ ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) ↔ (𝐴 ∪ 𝐵) ⊆ ((V × V) × V))
2		ssrelrel 5736	. . . 4 ⊢ (𝐴 ⊆ ((V × V) × V) → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
3		ssrelrel 5736	. . . 4 ⊢ (𝐵 ⊆ ((V × V) × V) → (𝐵 ⊆ 𝐴 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
4	2, 3	bi2anan9 638	. . 3 ⊢ ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴))))
5		eqss 3950	. . 3 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
6		2albiim 1891	. . . . 5 ⊢ (∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ (∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
7	6	albii 1820	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ ∀𝑥(∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
8		19.26 1871	. . . 4 ⊢ (∀𝑥(∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
9	7, 8	bitri 275	. . 3 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
10	4, 5, 9	3bitr4g 314	. 2 ⊢ ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
11	1, 10	sylbir 235	1 ⊢ ((𝐴 ∪ 𝐵) ⊆ ((V × V) × V) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1539   = wceq 1541   ∈ wcel 2111  Vcvv 3436   ∪ cun 3900   ⊆ wss 3902  ⟨cop 4582   × cxp 5614

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-11 2160  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-opab 5154  df-xp 5622

This theorem is referenced by: (None)