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

Theorem xpopth 6338
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 6337 . . 3 (𝐴 ∈ (𝐶 × 𝐷) → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
2 1st2nd2 6337 . . 3 (𝐵 ∈ (𝑅 × 𝑆) → 𝐵 = ⟨(1st𝐵), (2nd𝐵)⟩)
31, 2eqeqan12d 2247 . 2 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (𝐴 = 𝐵 ↔ ⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩))
4 1stexg 6329 . . . 4 (𝐴 ∈ (𝐶 × 𝐷) → (1st𝐴) ∈ V)
5 2ndexg 6330 . . . 4 (𝐴 ∈ (𝐶 × 𝐷) → (2nd𝐴) ∈ V)
6 opthg 4330 . . . 4 (((1st𝐴) ∈ V ∧ (2nd𝐴) ∈ V) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
74, 5, 6syl2anc 411 . . 3 (𝐴 ∈ (𝐶 × 𝐷) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
87adantr 276 . 2 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (⟨(1st𝐴), (2nd𝐴)⟩ = ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵))))
93, 8bitr2d 189 1 ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (((1st𝐴) = (1st𝐵) ∧ (2nd𝐴) = (2nd𝐵)) ↔ 𝐴 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1397  wcel 2202  Vcvv 2802  cop 3672   × cxp 4723  cfv 5326  1st c1st 6300  2nd c2nd 6301
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fo 5332  df-fv 5334  df-1st 6302  df-2nd 6303
This theorem is referenced by:  xmetxp  15230  wlkeq  16204
  Copyright terms: Public domain W3C validator