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

Theorem oteqex 4889
Description: Equivalence of existence implied by equality of ordered triples. (Contributed by NM, 28-May-2008.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
oteqex (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V)))

Proof of Theorem oteqex
StepHypRef Expression
1 simp3 1056 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐶 ∈ V)
21a1i 11 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐶 ∈ V))
3 simp3 1056 . . 3 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) → 𝑇 ∈ V)
4 oteqex2 4888 . . 3 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → (𝐶 ∈ V ↔ 𝑇 ∈ V))
53, 4syl5ibr 235 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) → 𝐶 ∈ V))
6 opex 4859 . . . . . . . 8 𝐴, 𝐵⟩ ∈ V
7 opthg 4872 . . . . . . . 8 ((⟨𝐴, 𝐵⟩ ∈ V ∧ 𝐶 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ ∧ 𝐶 = 𝑇)))
86, 7mpan 702 . . . . . . 7 (𝐶 ∈ V → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ ∧ 𝐶 = 𝑇)))
98simprbda 651 . . . . . 6 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩)
10 opeqex 4887 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V)))
119, 10syl 17 . . . . 5 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V)))
124adantl 481 . . . . 5 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → (𝐶 ∈ V ↔ 𝑇 ∈ V))
1311, 12anbi12d 743 . . . 4 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐶 ∈ V) ↔ ((𝑅 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑇 ∈ V)))
14 df-3an 1033 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐶 ∈ V))
15 df-3an 1033 . . . 4 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) ↔ ((𝑅 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑇 ∈ V))
1613, 14, 153bitr4g 302 . . 3 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V)))
1716expcom 450 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → (𝐶 ∈ V → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V))))
182, 5, 17pm5.21ndd 368 1 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  Vcvv 3173  cop 4131
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator