Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ecxrn2 Structured version   Visualization version   GIF version

Theorem ecxrn2 39606
Description: The (𝑅 ⋉ 𝑆)-coset of a set is the Cartesian product of its 𝑅-coset and 𝑆-coset. (Contributed by Peter Mazsa, 16-Oct-2020.)
Assertion
Ref Expression
ecxrn2 (𝐴 ∈ 𝑉 → [𝐴](𝑅 ⋉ 𝑆) = ([𝐴]𝑅 × [𝐴]𝑆))

Proof of Theorem ecxrn2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relecxrn 39605 . . 3 (𝐴 ∈ 𝑉 → Rel [𝐴](𝑅 ⋉ 𝑆))
2 relxp 5676 . . 3 Rel ([𝐴]𝑅 × [𝐴]𝑆)
31, 2jctir 530 . 2 (𝐴 ∈ 𝑉 → (Rel [𝐴](𝑅 ⋉ 𝑆) ∧ Rel ([𝐴]𝑅 × [𝐴]𝑆)))
4 brxrn 39581 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝐴(𝑅 ⋉ 𝑆)⟨𝑥, 𝑦⟩ ↔ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)))
54el3v23 39432 . . . . 5 (𝐴 ∈ 𝑉 → (𝐴(𝑅 ⋉ 𝑆)⟨𝑥, 𝑦⟩ ↔ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)))
6 opex 5439 . . . . . 6 ⟨𝑥, 𝑦⟩ ∈ V
7 elecALTV 39469 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ ⟨𝑥, 𝑦⟩ ∈ V) → (⟨𝑥, 𝑦⟩ ∈ [𝐴](𝑅 ⋉ 𝑆) ↔ 𝐴(𝑅 ⋉ 𝑆)⟨𝑥, 𝑦⟩))
86, 7mpan2 704 . . . . 5 (𝐴 ∈ 𝑉 → (⟨𝑥, 𝑦⟩ ∈ [𝐴](𝑅 ⋉ 𝑆) ↔ 𝐴(𝑅 ⋉ 𝑆)⟨𝑥, 𝑦⟩))
9 elecALTV 39469 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ V) → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
109elvd 3460 . . . . . 6 (𝐴 ∈ 𝑉 → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
11 elecALTV 39469 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 𝑦 ∈ V) → (𝑦 ∈ [𝐴]𝑆 ↔ 𝐴𝑆𝑦))
1211elvd 3460 . . . . . 6 (𝐴 ∈ 𝑉 → (𝑦 ∈ [𝐴]𝑆 ↔ 𝐴𝑆𝑦))
1310, 12anbi12d 644 . . . . 5 (𝐴 ∈ 𝑉 → ((𝑥 ∈ [𝐴]𝑅 ∧ 𝑦 ∈ [𝐴]𝑆) ↔ (𝐴𝑅𝑥 ∧ 𝐴𝑆𝑦)))
145, 8, 133bitr4d 314 . . . 4 (𝐴 ∈ 𝑉 → (⟨𝑥, 𝑦⟩ ∈ [𝐴](𝑅 ⋉ 𝑆) ↔ (𝑥 ∈ [𝐴]𝑅 ∧ 𝑦 ∈ [𝐴]𝑆)))
15 opelxp 5694 . . . 4 (⟨𝑥, 𝑦⟩ ∈ ([𝐴]𝑅 × [𝐴]𝑆) ↔ (𝑥 ∈ [𝐴]𝑅 ∧ 𝑦 ∈ [𝐴]𝑆))
1614, 15bitr4di 292 . . 3 (𝐴 ∈ 𝑉 → (⟨𝑥, 𝑦⟩ ∈ [𝐴](𝑅 ⋉ 𝑆) ↔ ⟨𝑥, 𝑦⟩ ∈ ([𝐴]𝑅 × [𝐴]𝑆)))
1716eqrelrdv2 5780 . 2 (((Rel [𝐴](𝑅 ⋉ 𝑆) ∧ Rel ([𝐴]𝑅 × [𝐴]𝑆)) ∧ 𝐴 ∈ 𝑉) → [𝐴](𝑅 ⋉ 𝑆) = ([𝐴]𝑅 × [𝐴]𝑆))
183, 17mpancom 701 1 (𝐴 ∈ 𝑉 → [𝐴](𝑅 ⋉ 𝑆) = ([𝐴]𝑅 × [𝐴]𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   class class class wbr 5108   × cxp 5656  Rel wrel 5663  [cec 8753   ⋉ cxrn 39372
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fo 6572  df-fv 6574  df-1st 8035  df-2nd 8036  df-ec 8757  df-xrn 39578
This theorem is used by:  ecxrncnvep2  39608
  Copyright terms: Public domain W3C validator