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

Theorem oteqex 5239
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 1118 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐶 ∈ V)
21a1i 11 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐶 ∈ V))
3 simp3 1118 . . 3 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) → 𝑇 ∈ V)
4 oteqex2 5238 . . 3 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → (𝐶 ∈ V ↔ 𝑇 ∈ V))
53, 4syl5ibr 238 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) → 𝐶 ∈ V))
6 opex 5206 . . . . . . . 8 𝐴, 𝐵⟩ ∈ V
7 opthg 5219 . . . . . . . 8 ((⟨𝐴, 𝐵⟩ ∈ V ∧ 𝐶 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ ∧ 𝐶 = 𝑇)))
86, 7mpan 677 . . . . . . 7 (𝐶 ∈ V → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ ↔ (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ ∧ 𝐶 = 𝑇)))
98simprbda 491 . . . . . 6 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩)
10 opeqex 5237 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝑅, 𝑆⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V)))
119, 10syl 17 . . . . 5 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V)))
124adantl 474 . . . . 5 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → (𝐶 ∈ V ↔ 𝑇 ∈ V))
1311, 12anbi12d 621 . . . 4 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐶 ∈ V) ↔ ((𝑅 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑇 ∈ V)))
14 df-3an 1070 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐶 ∈ V))
15 df-3an 1070 . . . 4 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V) ↔ ((𝑅 ∈ V ∧ 𝑆 ∈ V) ∧ 𝑇 ∈ V))
1613, 14, 153bitr4g 306 . . 3 ((𝐶 ∈ V ∧ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩) → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V)))
1716expcom 406 . 2 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → (𝐶 ∈ V → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V))))
182, 5, 17pm5.21ndd 372 1 (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑅, 𝑆⟩, 𝑇⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝑅 ∈ V ∧ 𝑆 ∈ V ∧ 𝑇 ∈ V)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 387  w3a 1068   = wceq 1507  wcel 2048  Vcvv 3409  cop 4441
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-ext 2745  ax-sep 5054  ax-nul 5061  ax-pr 5180
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ne 2962  df-rab 3091  df-v 3411  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-nul 4174  df-if 4345  df-sn 4436  df-pr 4438  df-op 4442
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator