![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > refref | Structured version Visualization version GIF version |
Description: Reflexivity of refinement. (Contributed by Jeff Hankins, 18-Jan-2010.) |
Ref | Expression |
---|---|
refref | ⊢ (𝐴 ∈ 𝑉 → 𝐴Ref𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2725 | . . 3 ⊢ ∪ 𝐴 = ∪ 𝐴 | |
2 | ssid 4000 | . . . . 5 ⊢ 𝑥 ⊆ 𝑥 | |
3 | sseq2 4004 | . . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝑥)) | |
4 | 3 | rspcev 3607 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ⊆ 𝑥) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦) |
5 | 2, 4 | mpan2 689 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦) |
6 | 5 | rgen 3053 | . . 3 ⊢ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦 |
7 | 1, 6 | pm3.2i 469 | . 2 ⊢ (∪ 𝐴 = ∪ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦) |
8 | 1, 1 | isref 23443 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴Ref𝐴 ↔ (∪ 𝐴 = ∪ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))) |
9 | 7, 8 | mpbiri 257 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴Ref𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∀wral 3051 ∃wrex 3060 ⊆ wss 3945 ∪ cuni 4908 class class class wbr 5148 Refcref 23436 |
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-ext 2696 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2703 df-cleq 2717 df-clel 2802 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3465 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-br 5149 df-opab 5211 df-xp 5683 df-rel 5684 df-ref 23439 |
This theorem is referenced by: locfinref 33512 |
Copyright terms: Public domain | W3C validator |