| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > disjrnmpt | Structured version Visualization version GIF version | ||
| Description: Rewriting a disjoint collection using the range of a mapping. (Contributed by Thierry Arnoux, 27-May-2020.) |
| Ref | Expression |
|---|---|
| disjrnmpt | ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjabrex 33274 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑦 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵}𝑦) | |
| 2 | eqid 2763 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 3 | 2 | rnmpt 5951 | . . 3 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵} |
| 4 | disjeq1 5082 | . . 3 ⊢ (ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵} → (Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ↔ Disj 𝑦 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵}𝑦)) | |
| 5 | 3, 4 | ax-mp 5 | . 2 ⊢ (Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ↔ Disj 𝑦 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵}𝑦) |
| 6 | 1, 5 | sylibr 237 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 {cab 2741 ∃wrex 3090 Disj wdisj 5075 ↦ cmpt 5192 ran crn 5659 |
| 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-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-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 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-mpt 5193 df-cnv 5666 df-dm 5668 df-rn 5669 |
| This theorem is used by: fnpreimac 33362 sigapildsys 34906 ldgenpisyslem1 34907 carsgclctunlem2 35062 pmeasadd 35068 |
| Copyright terms: Public domain | W3C validator |