Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  disjrdx Structured version   Visualization version   GIF version

Theorem disjrdx 33185
Description: Re-index a disjunct collection statement. (Contributed by Thierry Arnoux, 7-Apr-2017.)
Hypotheses
Ref Expression
disjrdx.1 (𝜑 → 𝐹:𝐴–1-1-onto→𝐶)
disjrdx.2 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)
Assertion
Ref Expression
disjrdx (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐶 𝐷))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷   𝑥,𝐹,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝐵(𝑥)   𝐷(𝑦)

Proof of Theorem disjrdx
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 disjrdx.1 . . . . . . 7 (𝜑 → 𝐹:𝐴–1-1-onto→𝐶)
2 f1of 6824 . . . . . . 7 (𝐹:𝐴–1-1-onto→𝐶 → 𝐹:𝐴⟶𝐶)
31, 2syl 18 . . . . . 6 (𝜑 → 𝐹:𝐴⟶𝐶)
43ffvelcdmda 7084 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶)
5 f1ofveu 7414 . . . . . . 7 ((𝐹:𝐴–1-1-onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
61, 5sylan 592 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
7 eqcom 2768 . . . . . . 7 ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
87reubii 3375 . . . . . 6 (∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 ↔ ∃!𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
96, 8sylib 221 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
10 disjrdx.2 . . . . . 6 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)
1110eleq2d 2847 . . . . 5 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵))
124, 9, 11rmoxfrd 33089 . . . 4 (𝜑 → (∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵))
1312bicomd 226 . . 3 (𝜑 → (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
1413albidv 1953 . 2 (𝜑 → (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
15 df-disj 5071 . 2 (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
16 df-disj 5071 . 2 (Disj 𝑦 ∈ 𝐶 𝐷 ↔ ∀𝑧∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷)
1714, 15, 163bitr4g 317 1 (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐶 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∃!wreu 3364  ∃*wrmo 3365  Disj wdisj 5070  ⟶wf 6534  –1-1-onto→wf1o 6537  ‘cfv 6538
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
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-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  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-disj 5071  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546
This theorem is used by:  tocyccntz  33705  volmeas  34864  carsggect  34950
  Copyright terms: Public domain W3C validator