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

Theorem elxp7 5720
 Description: Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 4735. (Contributed by NM, 19-Aug-2006.)
Assertion
Ref Expression
elxp7 (A (B × 𝐶) ↔ (A (V × V) ((1stA) B (2ndA) 𝐶)))

Proof of Theorem elxp7
StepHypRef Expression
1 elex 2543 . 2 (A (B × 𝐶) → A V)
2 elex 2543 . . 3 (A (V × V) → A V)
32adantr 261 . 2 ((A (V × V) ((1stA) B (2ndA) 𝐶)) → A V)
4 1stexg 5717 . . . . . . 7 (A V → (1stA) V)
5 2ndexg 5718 . . . . . . 7 (A V → (2ndA) V)
64, 5jca 290 . . . . . 6 (A V → ((1stA) V (2ndA) V))
76biantrud 288 . . . . 5 (A V → (A = ⟨(1stA), (2ndA)⟩ ↔ (A = ⟨(1stA), (2ndA)⟩ ((1stA) V (2ndA) V))))
8 elxp6 5719 . . . . 5 (A (V × V) ↔ (A = ⟨(1stA), (2ndA)⟩ ((1stA) V (2ndA) V)))
97, 8syl6rbbr 188 . . . 4 (A V → (A (V × V) ↔ A = ⟨(1stA), (2ndA)⟩))
109anbi1d 441 . . 3 (A V → ((A (V × V) ((1stA) B (2ndA) 𝐶)) ↔ (A = ⟨(1stA), (2ndA)⟩ ((1stA) B (2ndA) 𝐶))))
11 elxp6 5719 . . 3 (A (B × 𝐶) ↔ (A = ⟨(1stA), (2ndA)⟩ ((1stA) B (2ndA) 𝐶)))
1210, 11syl6rbbr 188 . 2 (A V → (A (B × 𝐶) ↔ (A (V × V) ((1stA) B (2ndA) 𝐶))))
131, 3, 12pm5.21nii 607 1 (A (B × 𝐶) ↔ (A (V × V) ((1stA) B (2ndA) 𝐶)))
 Colors of variables: wff set class Syntax hints:   ∧ wa 97   ↔ wb 98   = wceq 1228   ∈ wcel 1374  Vcvv 2535  ⟨cop 3353   × cxp 4270  ‘cfv 4829  1st c1st 5688  2nd c2nd 5689 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 617  ax-5 1316  ax-7 1317  ax-gen 1318  ax-ie1 1363  ax-ie2 1364  ax-8 1376  ax-10 1377  ax-11 1378  ax-i12 1379  ax-bnd 1380  ax-4 1381  ax-13 1385  ax-14 1386  ax-17 1400  ax-i9 1404  ax-ial 1409  ax-i5r 1410  ax-ext 2004  ax-sep 3849  ax-pow 3901  ax-pr 3918  ax-un 4120 This theorem depends on definitions:  df-bi 110  df-3an 875  df-tru 1231  df-nf 1330  df-sb 1628  df-eu 1885  df-mo 1886  df-clab 2009  df-cleq 2015  df-clel 2018  df-nfc 2149  df-ral 2289  df-rex 2290  df-v 2537  df-sbc 2742  df-un 2899  df-in 2901  df-ss 2908  df-pw 3336  df-sn 3356  df-pr 3357  df-op 3359  df-uni 3555  df-br 3739  df-opab 3793  df-mpt 3794  df-id 4004  df-xp 4278  df-rel 4279  df-cnv 4280  df-co 4281  df-dm 4282  df-rn 4283  df-iota 4794  df-fun 4831  df-fn 4832  df-f 4833  df-fo 4835  df-fv 4837  df-1st 5690  df-2nd 5691 This theorem is referenced by:  xp2  5722  unielxp  5723  1stconst  5765  2ndconst  5766
 Copyright terms: Public domain W3C validator