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 33283
Description: Re-index a disjunct collection statement. (Contributed by Thierry Arnoux, 7-Apr-2017.)
Hypotheses
Ref Expression
disjrdx.1 (𝜑 → 𝐹:𝐴⟶1-1onto𝐶)
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-1onto𝐶)
2 f1of 6854 . . . . . . 7 (𝐹:𝐴⟶1-1onto𝐶 → 𝐹:𝐴⟶𝐶)
31, 2syl 18 . . . . . 6 (𝜑 → 𝐹:𝐴⟶𝐶)
43ffvelcdmda 7116 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶)
5 f1ofveu 7445 . . . . . . 7 ((𝐹:𝐴⟶1-1onto𝐶 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
61, 5sylan 592 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
7 eqcom 2770 . . . . . . 7 ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
87reubii 3378 . . . . . 6 (∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 ↔ ∃!𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
96, 8sylib 221 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
10 disjrdx.2 . . . . . 6 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)
1110eleq2d 2850 . . . . 5 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵))
124, 9, 11rmoxfrd 33188 . . . 4 (𝜑 → (∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵))
1312bicomd 226 . . 3 (𝜑 → (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
1413albidv 1955 . 2 (𝜑 → (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
15 df-disj 5076 . 2 (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
16 df-disj 5076 . 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 2147  ∃!wreu 3367  ∃*wrmo 3368  Disj wdisj 5075  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-disj 5076  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by:  tocyccntz  33804  volmeas  34975  carsggect  35061
  Copyright terms: Public domain W3C validator