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 33239
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 6832 . . . . . . 7 (𝐹:𝐴–1-1-onto→𝐶 → 𝐹:𝐴⟶𝐶)
31, 2syl 18 . . . . . 6 (𝜑 → 𝐹:𝐴⟶𝐶)
43ffvelcdmda 7092 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶)
5 f1ofveu 7421 . . . . . . 7 ((𝐹:𝐴–1-1-onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
61, 5sylan 592 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
7 eqcom 2770 . . . . . . 7 ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
87reubii 3377 . . . . . 6 (∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 ↔ ∃!𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
96, 8sylib 221 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃!𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
10 disjrdx.2 . . . . . 6 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)
1110eleq2d 2849 . . . . 5 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵))
124, 9, 11rmoxfrd 33143 . . . 4 (𝜑 → (∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵))
1312bicomd 226 . . 3 (𝜑 → (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
1413albidv 1954 . 2 (𝜑 → (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
15 df-disj 5073 . 2 (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
16 df-disj 5073 . 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 1567   = wceq 1569   ∈ wcel 2146  ∃!wreu 3366  ∃*wrmo 3367  Disj wdisj 5072  ⟶wf 6542  –1-1-onto→wf1o 6545  ‘cfv 6546
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pr 5394
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-disj 5073  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554
This theorem is used by:  tocyccntz  33758  volmeas  34917  carsggect  35003
  Copyright terms: Public domain W3C validator