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

Theorem dmqsblocks 39463
Description: If the pet 39461 span (𝑅 ⋉ ( E ↾ 𝐴)) partitions 𝐴, then every block 𝑢𝐴 is of the form [𝑣] for some 𝑣 that not only lies in the domain but also has at least one internal element 𝑐 and at least one 𝑅-target 𝑏 (cf. also the comments of qseq 39229). It makes explicit that pet 39461 gives active representatives for each block, without ever forcing 𝑣 = 𝑢. (Contributed by Peter Mazsa, 23-Nov-2025.)
Assertion
Ref Expression
dmqsblocks ((dom (𝑅 ⋉ ( E ↾ 𝐴)) / (𝑅 ⋉ ( E ↾ 𝐴))) = 𝐴 → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
Distinct variable groups:   𝐴,𝑏,𝑐,𝑢,𝑣   𝑅,𝑏,𝑐,𝑢,𝑣

Proof of Theorem dmqsblocks
StepHypRef Expression
1 qseq 39229 . . 3 ((dom (𝑅 ⋉ ( E ↾ 𝐴)) / (𝑅 ⋉ ( E ↾ 𝐴))) = 𝐴 ↔ ∀𝑢(𝑢𝐴 ↔ ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))))
2 eqab2 38746 . . 3 (∀𝑢(𝑢𝐴 ↔ ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)))
31, 2sylbi 219 . 2 ((dom (𝑅 ⋉ ( E ↾ 𝐴)) / (𝑅 ⋉ ( E ↾ 𝐴))) = 𝐴 → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)))
4 rexanid 3111 . . . 4 (∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))(𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) ↔ ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)))
5 eldmxrncnvepres2 38931 . . . . . . . . . 10 (𝑣 ∈ V → (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ↔ (𝑣𝐴 ∧ ∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏)))
65elv 3459 . . . . . . . . 9 (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ↔ (𝑣𝐴 ∧ ∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
7 3simpc 1163 . . . . . . . . 9 ((𝑣𝐴 ∧ ∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏) → (∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
86, 7sylbi 219 . . . . . . . 8 (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) → (∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
9 exdistrv 1975 . . . . . . . . 9 (∃𝑐𝑏(𝑐𝑣𝑣𝑅𝑏) ↔ (∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
10 excom 2196 . . . . . . . . 9 (∃𝑐𝑏(𝑐𝑣𝑣𝑅𝑏) ↔ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏))
119, 10bitr3i 279 . . . . . . . 8 ((∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏) ↔ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏))
128, 11sylib 220 . . . . . . 7 (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) → ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏))
1312anim1ci 625 . . . . . 6 ((𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → (𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏)))
14 3anass 1106 . . . . . . . 8 ((𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏) ↔ (𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ (𝑐𝑣𝑣𝑅𝑏)))
15142exbii 1869 . . . . . . 7 (∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏) ↔ ∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ (𝑐𝑣𝑣𝑅𝑏)))
16 19.42vv 1977 . . . . . . 7 (∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ (𝑐𝑣𝑣𝑅𝑏)) ↔ (𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏)))
1715, 16sylbbr 238 . . . . . 6 ((𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏)) → ∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
1813, 17syl 17 . . . . 5 ((𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → ∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
1918reximi 3100 . . . 4 (∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))(𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
204, 19sylbir 237 . . 3 (∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) → ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
2120ralimi 3099 . 2 (∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
223, 21syl 17 1 ((dom (𝑅 ⋉ ( E ↾ 𝐴)) / (𝑅 ⋉ ( E ↾ 𝐴))) = 𝐴 → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1098  wal 1558   = wceq 1560  wex 1799  wcel 2142  wral 3076  wrex 3086  Vcvv 3454   class class class wbr 5100   E cep 5546  ccnv 5646  dom cdm 5647  cres 5649  [cec 8676   / cqs 8677  cxrn 38670
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-sbc 3745  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-eprel 5547  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-fo 6527  df-fv 6529  df-oprab 7400  df-1st 7970  df-2nd 7971  df-qs 8684  df-xrn 38876
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator