![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > abfmpunirn | Structured version Visualization version GIF version |
Description: Membership in a union of a mapping function-defined family of sets. (Contributed by Thierry Arnoux, 28-Sep-2016.) |
Ref | Expression |
---|---|
abfmpunirn.1 | ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∣ 𝜑}) |
abfmpunirn.2 | ⊢ {𝑦 ∣ 𝜑} ∈ V |
abfmpunirn.3 | ⊢ (𝑦 = 𝐵 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
abfmpunirn | ⊢ (𝐵 ∈ ∪ ran 𝐹 ↔ (𝐵 ∈ V ∧ ∃𝑥 ∈ 𝑉 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3485 | . 2 ⊢ (𝐵 ∈ ∪ ran 𝐹 → 𝐵 ∈ V) | |
2 | abfmpunirn.2 | . . . . . 6 ⊢ {𝑦 ∣ 𝜑} ∈ V | |
3 | abfmpunirn.1 | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∣ 𝜑}) | |
4 | 2, 3 | fnmpti 6683 | . . . . 5 ⊢ 𝐹 Fn 𝑉 |
5 | fnunirn 7245 | . . . . 5 ⊢ (𝐹 Fn 𝑉 → (𝐵 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 𝐵 ∈ (𝐹‘𝑥))) | |
6 | 4, 5 | ax-mp 5 | . . . 4 ⊢ (𝐵 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 𝐵 ∈ (𝐹‘𝑥)) |
7 | 3 | fvmpt2 6999 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝑉 ∧ {𝑦 ∣ 𝜑} ∈ V) → (𝐹‘𝑥) = {𝑦 ∣ 𝜑}) |
8 | 2, 7 | mpan2 688 | . . . . . 6 ⊢ (𝑥 ∈ 𝑉 → (𝐹‘𝑥) = {𝑦 ∣ 𝜑}) |
9 | 8 | eleq2d 2811 | . . . . 5 ⊢ (𝑥 ∈ 𝑉 → (𝐵 ∈ (𝐹‘𝑥) ↔ 𝐵 ∈ {𝑦 ∣ 𝜑})) |
10 | 9 | rexbiia 3084 | . . . 4 ⊢ (∃𝑥 ∈ 𝑉 𝐵 ∈ (𝐹‘𝑥) ↔ ∃𝑥 ∈ 𝑉 𝐵 ∈ {𝑦 ∣ 𝜑}) |
11 | 6, 10 | bitri 275 | . . 3 ⊢ (𝐵 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 𝐵 ∈ {𝑦 ∣ 𝜑}) |
12 | abfmpunirn.3 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝜑 ↔ 𝜓)) | |
13 | 12 | elabg 3658 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∈ {𝑦 ∣ 𝜑} ↔ 𝜓)) |
14 | 13 | rexbidv 3170 | . . 3 ⊢ (𝐵 ∈ V → (∃𝑥 ∈ 𝑉 𝐵 ∈ {𝑦 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝑉 𝜓)) |
15 | 11, 14 | bitrid 283 | . 2 ⊢ (𝐵 ∈ V → (𝐵 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 𝜓)) |
16 | 1, 15 | biadanii 819 | 1 ⊢ (𝐵 ∈ ∪ ran 𝐹 ↔ (𝐵 ∈ V ∧ ∃𝑥 ∈ 𝑉 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 {cab 2701 ∃wrex 3062 Vcvv 3466 ∪ cuni 4899 ↦ cmpt 5221 ran crn 5667 Fn wfn 6528 ‘cfv 6533 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pr 5417 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-br 5139 df-opab 5201 df-mpt 5222 df-id 5564 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6485 df-fun 6535 df-fn 6536 df-fv 6541 |
This theorem is referenced by: rabfmpunirn 32347 isrnsiga 33600 isrnmeas 33687 |
Copyright terms: Public domain | W3C validator |