MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eqrelrel Structured version   Visualization version   GIF version

Theorem eqrelrel 5779
Description: Extensionality principle for ordered triples (used by 2-place operations df-oprab 7450), analogous to eqrel 5766. Use relrelss 6294 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
StepHypRef Expression
1 unss 4191 . 2 ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) ↔ (𝐴 ∪ 𝐵) ⊆ ((V × V) × V))
2 ssrelrel 5778 . . . 4 (𝐴 ⊆ ((V × V) × V) → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
3 ssrelrel 5778 . . . 4 (𝐵 ⊆ ((V × V) × V) → (𝐵 ⊆ 𝐴 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
42, 3bi2anan9 650 . . 3 ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴))))
5 eqss 3928 . . 3 (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
6 2albiim 1925 . . . . 5 (∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ (∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
76albii 1852 . . . 4 (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ ∀𝑥(∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
8 19.26 1903 . . . 4 (∀𝑥(∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
97, 8bitri 278 . . 3 (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ↔ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) ∧ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴)))
104, 5, 93bitr4g 317 . 2 ((𝐴 ⊆ ((V × V) × V) ∧ 𝐵 ⊆ ((V × V) × V)) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
111, 10sylbir 238 1 ((𝐴 ∪ 𝐵) ⊆ ((V × V) × V) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ⟨cop 4838   × cxp 5654
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-ext 2735  ax-sep 5253  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-opab 5172  df-xp 5662
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator