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

Theorem oteqex 5417
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 1137 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐶 ∈ V)
21a1i 11 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐶 ∈ V))
3 simp3 1137 . . 3 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) → 𝑇 ∈ V)
4 oteqex2 5416 . . 3 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → (𝐶 ∈ V ↔ 𝑇 ∈ V))
53, 4syl5ibr 245 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) → 𝐶 ∈ V))
6 opex 5382 . . . . . . . 8 𝐴, 𝐵⟩ ∈ V
7 opthg 5395 . . . . . . . 8 ((⟨𝐴, 𝐵⟩ ∈ V ∧ 𝐶 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ ∧ 𝐶 = 𝑇)))
86, 7mpan 687 . . . . . . 7 (𝐶 ∈ V → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ ∧ 𝐶 = 𝑇)))
98simprbda 499 . . . . . 6 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩)
10 opeqex 5415 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V)))
119, 10syl 17 . . . . 5 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V)))
124adantl 482 . . . . 5 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → (𝐶 ∈ V ↔ 𝑇 ∈ V))
1311, 12anbi12d 631 . . . 4 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐶 ∈ V) ↔ ((𝑅 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑇 ∈ V)))
14 df-3an 1088 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐶 ∈ V))
15 df-3an 1088 . . . 4 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) ↔ ((𝑅 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑇 ∈ V))
1613, 14, 153bitr4g 314 . . 3 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V)))
1716expcom 414 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → (𝐶 ∈ V → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V))))
182, 5, 17pm5.21ndd 381 1 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1542  wcel 2110  Vcvv 3431  cop 4573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pr 5356
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-sb 2072  df-clab 2718  df-cleq 2732  df-clel 2818  df-ne 2946  df-rab 3075  df-v 3433  df-dif 3895  df-un 3897  df-nul 4263  df-if 4466  df-sn 4568  df-pr 4570  df-op 4574
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator