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 39505
Description: If the pet 39503 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 39271). It makes explicit that pet 39503 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 39271 . . 3 ((dom (𝑅 ⋉ ( E ↾ 𝐴)) / (𝑅 ⋉ ( E ↾ 𝐴))) = 𝐴 ↔ ∀𝑢(𝑢𝐴 ↔ ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))))
2 eqab2 38788 . . 3 (∀𝑢(𝑢𝐴 ↔ ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)))
31, 2sylbi 220 . 2 ((dom (𝑅 ⋉ ( E ↾ 𝐴)) / (𝑅 ⋉ ( E ↾ 𝐴))) = 𝐴 → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)))
4 rexanid 3120 . . . 4 (∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))(𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) ↔ ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)))
5 eldmxrncnvepres2 38973 . . . . . . . . . 10 (𝑣 ∈ V → (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ↔ (𝑣𝐴 ∧ ∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏)))
65elv 3468 . . . . . . . . 9 (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ↔ (𝑣𝐴 ∧ ∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
7 3simpc 1166 . . . . . . . . 9 ((𝑣𝐴 ∧ ∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏) → (∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
86, 7sylbi 220 . . . . . . . 8 (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) → (∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
9 exdistrv 1982 . . . . . . . . 9 (∃𝑐𝑏(𝑐𝑣𝑣𝑅𝑏) ↔ (∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
10 excom 2203 . . . . . . . . 9 (∃𝑐𝑏(𝑐𝑣𝑣𝑅𝑏) ↔ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏))
119, 10bitr3i 280 . . . . . . . 8 ((∃𝑐 𝑐𝑣 ∧ ∃𝑏 𝑣𝑅𝑏) ↔ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏))
128, 11sylib 221 . . . . . . 7 (𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) → ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏))
1312anim1ci 627 . . . . . 6 ((𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → (𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏)))
14 3anass 1109 . . . . . . . 8 ((𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏) ↔ (𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ (𝑐𝑣𝑣𝑅𝑏)))
15142exbii 1876 . . . . . . 7 (∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏) ↔ ∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ (𝑐𝑣𝑣𝑅𝑏)))
16 19.42vv 1984 . . . . . . 7 (∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ (𝑐𝑣𝑣𝑅𝑏)) ↔ (𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏)))
1715, 16sylbbr 239 . . . . . 6 ((𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ ∃𝑏𝑐(𝑐𝑣𝑣𝑅𝑏)) → ∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
1813, 17syl 18 . . . . 5 ((𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → ∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
1918reximi 3109 . . . 4 (∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))(𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴))) → ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
204, 19sylbir 238 . . 3 (∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) → ∃𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
2120ralimi 3108 . 2 (∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
223, 21syl 18 1 ((dom (𝑅 ⋉ ( E ↾ 𝐴)) / (𝑅 ⋉ ( E ↾ 𝐴))) = 𝐴 → ∀𝑢𝐴𝑣 ∈ dom (𝑅 ⋉ ( E ↾ 𝐴))∃𝑏𝑐(𝑢 = [𝑣](𝑅 ⋉ ( E ↾ 𝐴)) ∧ 𝑐𝑣𝑣𝑅𝑏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101  wal 1565   = wceq 1567  wex 1806  wcel 2149  wral 3085  wrex 3095  Vcvv 3463   class class class wbr 5113   E cep 5561  ccnv 5661  dom cdm 5662  cres 5664  [cec 8691   / cqs 8692  cxrn 38712
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-eprel 5562  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-oprab 7415  df-1st 7985  df-2nd 7986  df-qs 8699  df-xrn 38918
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator