Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > strfv2 | Structured version Visualization version GIF version |
Description: A variation on strfv 15735 to avoid asserting that 𝑆 itself is a function, which involves sethood of all the ordered pair components of 𝑆. (Contributed by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
strfv2.s | ⊢ 𝑆 ∈ V |
strfv2.f | ⊢ Fun ◡◡𝑆 |
strfv2.e | ⊢ 𝐸 = Slot (𝐸‘ndx) |
strfv2.n | ⊢ 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 |
Ref | Expression |
---|---|
strfv2 | ⊢ (𝐶 ∈ 𝑉 → 𝐶 = (𝐸‘𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | strfv2.e | . 2 ⊢ 𝐸 = Slot (𝐸‘ndx) | |
2 | strfv2.s | . . 3 ⊢ 𝑆 ∈ V | |
3 | 2 | a1i 11 | . 2 ⊢ (𝐶 ∈ 𝑉 → 𝑆 ∈ V) |
4 | strfv2.f | . . 3 ⊢ Fun ◡◡𝑆 | |
5 | 4 | a1i 11 | . 2 ⊢ (𝐶 ∈ 𝑉 → Fun ◡◡𝑆) |
6 | strfv2.n | . . 3 ⊢ 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 | |
7 | 6 | a1i 11 | . 2 ⊢ (𝐶 ∈ 𝑉 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) |
8 | id 22 | . 2 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ 𝑉) | |
9 | 1, 3, 5, 7, 8 | strfv2d 15733 | 1 ⊢ (𝐶 ∈ 𝑉 → 𝐶 = (𝐸‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 Vcvv 3173 〈cop 4131 ◡ccnv 5037 Fun wfun 5798 ‘cfv 5804 ndxcnx 15692 Slot cslot 15694 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-res 5050 df-iota 5768 df-fun 5806 df-fv 5812 df-slot 15699 |
This theorem is referenced by: strfv 15735 |
Copyright terms: Public domain | W3C validator |