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

Theorem elxp6 8039
Description: Membership in a Cartesian product. This version requires no quantifiers or dummy variables. See also elxp4 7938. (Contributed by NM, 9-Oct-2004.)
Assertion
Ref Expression
elxp6 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)))

Proof of Theorem elxp6
StepHypRef Expression
1 elxp4 7938 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩ ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
2 1stval 8007 . . . . 5 (1st ‘𝐴) = ∪ dom {𝐴}
3 2ndval 8008 . . . . 5 (2nd ‘𝐴) = ∪ ran {𝐴}
42, 3opeq12i 4844 . . . 4 ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩
54eqeq2i 2773 . . 3 (𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ↔ 𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩)
62eleq1i 2851 . . . 4 ((1st ‘𝐴) ∈ 𝐵 ↔ ∪ dom {𝐴} ∈ 𝐵)
73eleq1i 2851 . . . 4 ((2nd ‘𝐴) ∈ 𝐶 ↔ ∪ ran {𝐴} ∈ 𝐶)
86, 7anbi12i 640 . . 3 (((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶) ↔ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))
95, 8anbi12i 640 . 2 ((𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)) ↔ (𝐴 = ⟨∪ dom {𝐴}, ∪ ran {𝐴}⟩ ∧ (∪ dom {𝐴} ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
101, 9bitr4i 281 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {csn 4584  ⟨cop 4834  ∪ cuni 4866   × cxp 5649  dom cdm 5651  ran crn 5652  ‘cfv 6543  1st c1st 8003  2nd c2nd 8004
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6497  df-fun 6545  df-fv 6551  df-1st 8005  df-2nd 8006
This theorem is used by:  elxp7  8040  eqopi  8041  1st2nd2  8044  eldju2ndl  10012  eldju2ndr  10013  r0weon  10098  qredeu  16842  qnumdencl  16924  setsstruct2  17361  tx1cn  23937  tx2cn  23938  txhaus  23975  psmetxrge0  24641  xppreima  33290  ofpreima2  33311  smatrcl  34478  1stmbfm  34942  2ndmbfm  34943  oddpwdcv  35037  prproropf1olem0  48692
  Copyright terms: Public domain W3C validator