Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > invdisj | Structured version Visualization version GIF version |
Description: If there is a function 𝐶(𝑦) such that 𝐶(𝑦) = 𝑥 for all 𝑦 ∈ 𝐵(𝑥), then the sets 𝐵(𝑥) for distinct 𝑥 ∈ 𝐴 are disjoint. (Contributed by Mario Carneiro, 10-Dec-2016.) |
Ref | Expression |
---|---|
invdisj | ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝑥 → Disj 𝑥 ∈ 𝐴 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfra2w 3227 | . . 3 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝑥 | |
2 | df-ral 3143 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝑥 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 = 𝑥)) | |
3 | rsp 3205 | . . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝑥 → (𝑦 ∈ 𝐵 → 𝐶 = 𝑥)) | |
4 | eqcom 2828 | . . . . . . . . 9 ⊢ (𝐶 = 𝑥 ↔ 𝑥 = 𝐶) | |
5 | 3, 4 | syl6ib 253 | . . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝑥 → (𝑦 ∈ 𝐵 → 𝑥 = 𝐶)) |
6 | 5 | imim2i 16 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 = 𝑥) → (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → 𝑥 = 𝐶))) |
7 | 6 | impd 413 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 = 𝑥) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑥 = 𝐶)) |
8 | 7 | alimi 1808 | . . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 = 𝑥) → ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑥 = 𝐶)) |
9 | 2, 8 | sylbi 219 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝑥 → ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑥 = 𝐶)) |
10 | mo2icl 3704 | . . . 4 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑥 = 𝐶) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
11 | 9, 10 | syl 17 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝑥 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
12 | 1, 11 | alrimi 2209 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝑥 → ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
13 | dfdisj2 5032 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
14 | 12, 13 | sylibr 236 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝑥 → Disj 𝑥 ∈ 𝐴 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∀wal 1531 = wceq 1533 ∈ wcel 2110 ∃*wmo 2616 ∀wral 3138 Disj wdisj 5030 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rmo 3146 df-v 3496 df-disj 5031 |
This theorem is referenced by: invdisjrabw 5050 invdisjrab 5051 ackbijnn 15182 incexc2 15192 phisum 16126 itg1addlem1 24292 musum 25767 lgsquadlem1 25955 lgsquadlem2 25956 disjabrex 30331 disjabrexf 30332 actfunsnrndisj 31876 poimirlem27 34918 |
Copyright terms: Public domain | W3C validator |