xpopth - Intuitionistic Logic Explorer

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

Theorem xpopth 6400

Description: An ordered pair theorem for members of cross products. (Contributed by NM, 20-Jun-2007.)

**Assertion**
Ref	Expression
xpopth	⊢ ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (((1^st ‘𝐴) = (1^st ‘𝐵) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) ↔ 𝐴 = 𝐵))

**Proof of Theorem xpopth**
Step	Hyp	Ref	Expression
1		1st2nd2 6399	. . 3 ⊢ (𝐴 ∈ (𝐶 × 𝐷) → 𝐴 = ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩)
2		1st2nd2 6399	. . 3 ⊢ (𝐵 ∈ (𝑅 × 𝑆) → 𝐵 = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩)
3	1, 2	eqeqan12d 2254	. 2 ⊢ ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (𝐴 = 𝐵 ↔ ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩))
4		1stexg 6391	. . . 4 ⊢ (𝐴 ∈ (𝐶 × 𝐷) → (1^st ‘𝐴) ∈ V)
5		2ndexg 6392	. . . 4 ⊢ (𝐴 ∈ (𝐶 × 𝐷) → (2^nd ‘𝐴) ∈ V)
6		opthg 4373	. . . 4 ⊢ (((1^st ‘𝐴) ∈ V ∧ (2^nd ‘𝐴) ∈ V) → (⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ↔ ((1^st ‘𝐴) = (1^st ‘𝐵) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵))))
7	4, 5, 6	syl2anc 415	. . 3 ⊢ (𝐴 ∈ (𝐶 × 𝐷) → (⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ↔ ((1^st ‘𝐴) = (1^st ‘𝐵) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵))))
8	7	adantr 276	. 2 ⊢ ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ = ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ↔ ((1^st ‘𝐴) = (1^st ‘𝐵) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵))))
9	3, 8	bitr2d 189	1 ⊢ ((𝐴 ∈ (𝐶 × 𝐷) ∧ 𝐵 ∈ (𝑅 × 𝑆)) → (((1^st ‘𝐴) = (1^st ‘𝐵) ∧ (2^nd ‘𝐴) = (2^nd ‘𝐵)) ↔ 𝐴 = 𝐵))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ⟨cop 3708 × cxp 4767 ‘cfv 5372 1^st c1st 6362 2^nd c2nd 6363

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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573

This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-fo 5378 df-fv 5380 df-1st 6364 df-2nd 6365

This theorem is referenced by: xmetxp 15531 wlkeq 16509