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

Theorem trcoss2 39643
Description: Equivalent expressions for the transitivity of cosets by 𝑅. (Contributed by Peter Mazsa, 4-Jul-2020.) (Revised by Peter Mazsa, 16-Oct-2021.)
Assertion
Ref Expression
trcoss2 (∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ ∀𝑥∀𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
Distinct variable groups:   𝑦,𝑅   𝑥,𝑦   𝑦,𝑧
Allowed substitution hints:   𝑅(𝑥, 𝑧)

Proof of Theorem trcoss2
StepHypRef Expression
1 alcom 2195 . . 3 (∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ ∀𝑧∀𝑦((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
21albii 1851 . 2 (∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ ∀𝑥∀𝑧∀𝑦((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
3 19.23v 1974 . . . 4 (∀𝑦(𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅) ↔ (∃𝑦 𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
4 eleccossin 39642 . . . . . . . 8 ((𝑦 ∈ V ∧ 𝑧 ∈ V) → (𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ↔ (𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧)))
54el2v 3457 . . . . . . 7 (𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ↔ (𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧))
65bicomi 227 . . . . . 6 ((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) ↔ 𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅))
7 brcoss3 39592 . . . . . . 7 ((𝑥 ∈ V ∧ 𝑧 ∈ V) → (𝑥 ≀ 𝑅𝑧 ↔ ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
87el2v 3457 . . . . . 6 (𝑥 ≀ 𝑅𝑧 ↔ ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅)
96, 8imbi12i 353 . . . . 5 (((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ (𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
109albii 1851 . . . 4 (∀𝑦((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ ∀𝑦(𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
11 n0 4299 . . . . 5 (([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅))
1211imbi1i 352 . . . 4 ((([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅) ↔ (∃𝑦 𝑦 ∈ ([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
133, 10, 123bitr4i 306 . . 3 (∀𝑦((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ (([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
14132albii 1852 . 2 (∀𝑥∀𝑧∀𝑦((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ ∀𝑥∀𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
152, 14bitri 278 1 (∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧) ↔ ∀𝑥∀𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]◡𝑅 ∩ [𝑧]◡𝑅) ≠ ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  Vcvv 3450   ∩ cin 4088  ∅c0 4277   class class class wbr 5102  ◡ccnv 5650  [cec 8723   ≀ ccoss 39252
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-11 2193  ax-ext 2732  ax-sep 5248  ax-pr 5391
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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  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-br 5103  df-opab 5167  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ec 8727  df-coss 39570
This theorem is used by:  eqvrelcoss4  39773
  Copyright terms: Public domain W3C validator