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

Theorem xpopth 5928
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 5927 . . 3 (𝐴 ∈ (𝐶 × 𝐷) → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
2 1st2nd2 5927 . . 3 (𝐵 ∈ (𝑅 × 𝑆) → 𝐵 = ⟨(1st𝐵), (2nd𝐵)⟩)
31, 2eqeqan12d 2103 . 2 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (𝐴 = 𝐵 ↔ ⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩))
4 1stexg 5920 . . . 4 (𝐴 ∈ (𝐶 × 𝐷) → (1st𝐴) ∈ V)
5 2ndexg 5921 . . . 4 (𝐴 ∈ (𝐶 × 𝐷) → (2nd𝐴) ∈ V)
6 opthg 4056 . . . 4 (((1st𝐴) ∈ V ∧ (2nd𝐴) ∈ V) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
74, 5, 6syl2anc 403 . . 3 (𝐴 ∈ (𝐶 × 𝐷) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
87adantr 270 . 2 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
93, 8bitr2d 187 1 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵)) ↔ 𝐴 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1289  wcel 1438  Vcvv 2619  cop 3444   × cxp 4426  cfv 5002  1st c1st 5891  2nd c2nd 5892
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3949  ax-pow 4001  ax-pr 4027  ax-un 4251
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-v 2621  df-sbc 2839  df-un 3001  df-in 3003  df-ss 3010  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450  df-uni 3649  df-br 3838  df-opab 3892  df-mpt 3893  df-id 4111  df-xp 4434  df-rel 4435  df-cnv 4436  df-co 4437  df-dm 4438  df-rn 4439  df-iota 4967  df-fun 5004  df-fn 5005  df-f 5006  df-fo 5008  df-fv 5010  df-1st 5893  df-2nd 5894
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator