Theorem disjrnmpt 32785

Description: Rewriting a disjoint collection using the range of a mapping. (Contributed by Thierry Arnoux, 27-May-2020.)

Assertion

Ref	Expression
disjrnmpt	⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦)

Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem disjrnmpt

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		disjabrex 32782	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑦 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵}𝑦)
2		eqid 2762	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
3	2	rnmpt 5933	. . 3 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵}
4		disjeq1 5074	. . 3 ⊢ (ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵} → (Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ↔ Disj 𝑦 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵}𝑦))
5	3, 4	ax-mp 5	. 2 ⊢ (Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ↔ Disj 𝑦 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵}𝑦)
6	1, 5	sylibr 236	1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦)

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1560  {cab 2740  ∃wrex 3086  Disj wdisj 5067   ↦ cmpt 5181  ran crn 5648

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-pr 5390

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-disj 5068  df-br 5101  df-opab 5163  df-mpt 5182  df-cnv 5655  df-dm 5657  df-rn 5658

This theorem is referenced by:  fnpreimac  32872  sigapildsys  34459  ldgenpisyslem1  34460  carsgclctunlem2  34616  pmeasadd  34622