ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xpopth GIF version

Theorem xpopth 5829
Description: An ordered pair theorem for members of cross products. (Contributed by NM, 20-Jun-2007.)
Assertion
Ref Expression
xpopth ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵)) ↔ 𝐴 = 𝐵))

Proof of Theorem xpopth
StepHypRef Expression
1 1st2nd2 5828 . . 3 (𝐴 ∈ (𝐶 × 𝐷) → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
2 1st2nd2 5828 . . 3 (𝐵 ∈ (𝑅 × 𝑆) → 𝐵 = ⟨(1st𝐵), (2nd𝐵)⟩)
31, 2eqeqan12d 2071 . 2 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (𝐴 = 𝐵 ↔ ⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩))
4 1stexg 5821 . . . 4 (𝐴 ∈ (𝐶 × 𝐷) → (1st𝐴) ∈ V)
5 2ndexg 5822 . . . 4 (𝐴 ∈ (𝐶 × 𝐷) → (2nd𝐴) ∈ V)
6 opthg 4002 . . . 4 (((1st𝐴) ∈ V ∧ (2nd𝐴) ∈ V) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
74, 5, 6syl2anc 397 . . 3 (𝐴 ∈ (𝐶 × 𝐷) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
87adantr 265 . 2 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
93, 8bitr2d 182 1 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵)) ↔ 𝐴 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102   = wceq 1259  wcel 1409  Vcvv 2574  cop 3405   × cxp 4370  cfv 4929  1st c1st 5792  2nd c2nd 5793
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-sbc 2787  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-br 3792  df-opab 3846  df-mpt 3847  df-id 4057  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-fo 4935  df-fv 4937  df-1st 5794  df-2nd 5795
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator