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

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

Proof of Theorem elxp6
StepHypRef Expression
1 elxp4 7873 . 2 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
2 1stval 7944 . . . . 5 (1st𝐴) = dom {𝐴}
3 2ndval 7945 . . . . 5 (2nd𝐴) = ran {𝐴}
42, 3opeq12i 4821 . . . 4 ⟨(1st𝐴), (2nd𝐴)⟩ = ⟨ dom {𝐴}, ran {𝐴}⟩
54eqeq2i 2749 . . 3 (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ↔ 𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩)
62eleq1i 2827 . . . 4 ((1st𝐴) ∈ 𝐵 dom {𝐴} ∈ 𝐵)
73eleq1i 2827 . . . 4 ((2nd𝐴) ∈ 𝐶 ran {𝐴} ∈ 𝐶)
86, 7anbi12i 629 . . 3 (((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶) ↔ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶))
95, 8anbi12i 629 . 2 ((𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))
101, 9bitr4i 278 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wcel 2114  {csn 4567  cop 4573   cuni 4850   × cxp 5629  dom cdm 5631  ran crn 5632  cfv 6498  1st c1st 7940  2nd c2nd 7941
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6454  df-fun 6500  df-fv 6506  df-1st 7942  df-2nd 7943
This theorem is referenced by:  elxp7  7977  eqopi  7978  1st2nd2  7981  eldju2ndl  9848  eldju2ndr  9849  r0weon  9934  qredeu  16627  qnumdencl  16709  setsstruct2  17144  tx1cn  23574  tx2cn  23575  txhaus  23612  psmetxrge0  24278  xppreima  32718  ofpreima2  32739  smatrcl  33940  1stmbfm  34404  2ndmbfm  34405  oddpwdcv  34499  prproropf1olem0  47962
  Copyright terms: Public domain W3C validator