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 39879
Description: If the pet 39877 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 39645). It makes explicit that pet 39877 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 39645 . . 3 ((dom (𝑅 ⋉ (◡ E ↾ 𝐴)) / (𝑅 ⋉ (◡ E ↾ 𝐴))) = 𝐴 ↔ ∀𝑢(𝑢 ∈ 𝐴 ↔ ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴))))
2 eqab2 39162 . . 3 (∀𝑢(𝑢 ∈ 𝐴 ↔ ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴))) → ∀𝑢 ∈ 𝐴 ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)))
31, 2sylbi 220 . 2 ((dom (𝑅 ⋉ (◡ E ↾ 𝐴)) / (𝑅 ⋉ (◡ E ↾ 𝐴))) = 𝐴 → ∀𝑢 ∈ 𝐴 ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)))
4 rexanid 3112 . . . 4 (∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))(𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴))) ↔ ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)))
5 eldmxrncnvepres2 39347 . . . . . . . . . 10 (𝑣 ∈ V → (𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) ↔ (𝑣 ∈ 𝐴 ∧ ∃𝑐 𝑐 ∈ 𝑣 ∧ ∃𝑏 𝑣𝑅𝑏)))
65elv 3456 . . . . . . . . 9 (𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) ↔ (𝑣 ∈ 𝐴 ∧ ∃𝑐 𝑐 ∈ 𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
7 3simpc 1168 . . . . . . . . 9 ((𝑣 ∈ 𝐴 ∧ ∃𝑐 𝑐 ∈ 𝑣 ∧ ∃𝑏 𝑣𝑅𝑏) → (∃𝑐 𝑐 ∈ 𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
86, 7sylbi 220 . . . . . . . 8 (𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) → (∃𝑐 𝑐 ∈ 𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
9 exdistrv 1988 . . . . . . . . 9 (∃𝑐∃𝑏(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏) ↔ (∃𝑐 𝑐 ∈ 𝑣 ∧ ∃𝑏 𝑣𝑅𝑏))
10 excom 2199 . . . . . . . . 9 (∃𝑐∃𝑏(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏) ↔ ∃𝑏∃𝑐(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
119, 10bitr3i 280 . . . . . . . 8 ((∃𝑐 𝑐 ∈ 𝑣 ∧ ∃𝑏 𝑣𝑅𝑏) ↔ ∃𝑏∃𝑐(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
128, 11sylib 221 . . . . . . 7 (𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) → ∃𝑏∃𝑐(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
1312anim1ci 628 . . . . . 6 ((𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴))) → (𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ ∃𝑏∃𝑐(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏)))
14 3anass 1111 . . . . . . . 8 ((𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏) ↔ (𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ (𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏)))
15142exbii 1882 . . . . . . 7 (∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏) ↔ ∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ (𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏)))
16 19.42vv 1990 . . . . . . 7 (∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ (𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏)) ↔ (𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ ∃𝑏∃𝑐(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏)))
1715, 16sylbbr 239 . . . . . 6 ((𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ ∃𝑏∃𝑐(𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏)) → ∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
1813, 17syl 18 . . . . 5 ((𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴))) → ∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
1918reximi 3101 . . . 4 (∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))(𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴))) → ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
204, 19sylbir 238 . . 3 (∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) → ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
2120ralimi 3100 . 2 (∀𝑢 ∈ 𝐴 ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) → ∀𝑢 ∈ 𝐴 ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
223, 21syl 18 1 ((dom (𝑅 ⋉ (◡ E ↾ 𝐴)) / (𝑅 ⋉ (◡ E ↾ 𝐴))) = 𝐴 → ∀𝑢 ∈ 𝐴 ∃𝑣 ∈ dom (𝑅 ⋉ (◡ E ↾ 𝐴))∃𝑏∃𝑐(𝑢 = [𝑣](𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ 𝑐 ∈ 𝑣 ∧ 𝑣𝑅𝑏))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   class class class wbr 5103   E cep 5550  ◡ccnv 5650  dom cdm 5651   ↾ cres 5653  [cec 8708   / cqs 8709   ⋉ cxrn 39086
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-eprel 5551  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-oprab 7422  df-1st 7999  df-2nd 8000  df-qs 8716  df-xrn 39292
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator