Metamath Proof Explorer


Theorem unirnmapsn

Description: Equality theorem for a subset of a set exponentiation, where the exponent is a singleton. (Contributed by Glauco Siliprandi, 3-Mar-2021)

Ref Expression
Hypotheses unirnmapsn.A ⊢ φ → A ∈ V
unirnmapsn.b ⊢ φ → B ∈ W
unirnmapsn.C ⊢ C = A
unirnmapsn.x ⊢ φ → X ⊆ B C
Assertion unirnmapsn ⊢ φ → X = ran ⁡ ⋃ X C

Proof

Step Hyp Ref Expression
1 unirnmapsn.A ⊢ φ → A ∈ V
2 unirnmapsn.b ⊢ φ → B ∈ W
3 unirnmapsn.C ⊢ C = A
4 unirnmapsn.x ⊢ φ → X ⊆ B C
5 snex ⊢ A ∈ V
6 3 5 eqeltri ⊢ C ∈ V
7 6 a1i ⊢ φ → C ∈ V
8 7 4 unirnmap ⊢ φ → X ⊆ ran ⁡ ⋃ X C
9 simpl ⊢ φ ∧ g ∈ ran ⁡ ⋃ X C → φ
10 equid ⊢ g = g
11 rnuni ⊢ ran ⁡ ⋃ X = ⋃ f ∈ X ran ⁡ f
12 11 oveq1i ⊢ ran ⁡ ⋃ X C = ⋃ f ∈ X ran ⁡ f C
13 10 12 eleq12i ⊢ g ∈ ran ⁡ ⋃ X C ↔ g ∈ ⋃ f ∈ X ran ⁡ f C
14 13 bilani ⊢ φ ∧ g ∈ ran ⁡ ⋃ X C → g ∈ ⋃ f ∈ X ran ⁡ f C
15 ovexd ⊢ φ → B C ∈ V
16 15 4 ssexd ⊢ φ → X ∈ V
17 rnexg ⊢ f ∈ X → ran ⁡ f ∈ V
18 17 rgen ⊢ ∀ f ∈ X ran ⁡ f ∈ V
19 18 a1i ⊢ φ → ∀ f ∈ X ran ⁡ f ∈ V
20 iunexg ⊢ X ∈ V ∧ ∀ f ∈ X ran ⁡ f ∈ V → ⋃ f ∈ X ran ⁡ f ∈ V
21 16 19 20 syl2anc ⊢ φ → ⋃ f ∈ X ran ⁡ f ∈ V
22 21 7 elmapd ⊢ φ → g ∈ ⋃ f ∈ X ran ⁡ f C ↔ g : C ⟶ ⋃ f ∈ X ran ⁡ f
23 22 biimpa ⊢ φ ∧ g ∈ ⋃ f ∈ X ran ⁡ f C → g : C ⟶ ⋃ f ∈ X ran ⁡ f
24 snidg ⊢ A ∈ V → A ∈ A
25 1 24 syl ⊢ φ → A ∈ A
26 25 3 eleqtrrdi ⊢ φ → A ∈ C
27 26 adantr ⊢ φ ∧ g ∈ ⋃ f ∈ X ran ⁡ f C → A ∈ C
28 23 27 ffvelcdmd ⊢ φ ∧ g ∈ ⋃ f ∈ X ran ⁡ f C → g ⁡ A ∈ ⋃ f ∈ X ran ⁡ f
29 eliun ⊢ g ⁡ A ∈ ⋃ f ∈ X ran ⁡ f ↔ ∃ f ∈ X g ⁡ A ∈ ran ⁡ f
30 28 29 sylib ⊢ φ ∧ g ∈ ⋃ f ∈ X ran ⁡ f C → ∃ f ∈ X g ⁡ A ∈ ran ⁡ f
31 9 14 30 syl2anc ⊢ φ ∧ g ∈ ran ⁡ ⋃ X C → ∃ f ∈ X g ⁡ A ∈ ran ⁡ f
32 elmapfn ⊢ g ∈ ran ⁡ ⋃ X C → g Fn C
33 32 adantl ⊢ φ ∧ g ∈ ran ⁡ ⋃ X C → g Fn C
34 simp3 ⊢ φ ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g ⁡ A ∈ ran ⁡ f
35 1 3ad2ant1 ⊢ φ ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → A ∈ V
36 3 oveq2i ⊢ B C = B A
37 4 36 sseqtrdi ⊢ φ → X ⊆ B A
38 37 adantr ⊢ φ ∧ f ∈ X → X ⊆ B A
39 simpr ⊢ φ ∧ f ∈ X → f ∈ X
40 38 39 sseldd ⊢ φ ∧ f ∈ X → f ∈ B A
41 2 adantr ⊢ φ ∧ f ∈ X → B ∈ W
42 5 a1i ⊢ φ ∧ f ∈ X → A ∈ V
43 41 42 elmapd ⊢ φ ∧ f ∈ X → f ∈ B A ↔ f : A ⟶ B
44 40 43 mpbid ⊢ φ ∧ f ∈ X → f : A ⟶ B
45 44 3adant3 ⊢ φ ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → f : A ⟶ B
46 35 45 rnsnf ⊢ φ ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → ran ⁡ f = f ⁡ A
47 34 46 eleqtrd ⊢ φ ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g ⁡ A ∈ f ⁡ A
48 fvex ⊢ g ⁡ A ∈ V
49 48 elsn ⊢ g ⁡ A ∈ f ⁡ A ↔ g ⁡ A = f ⁡ A
50 47 49 sylib ⊢ φ ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g ⁡ A = f ⁡ A
51 50 3adant1r ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g ⁡ A = f ⁡ A
52 1 adantr ⊢ φ ∧ g Fn C → A ∈ V
53 52 3ad2ant1 ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → A ∈ V
54 simp1r ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g Fn C
55 40 36 eleqtrrdi ⊢ φ ∧ f ∈ X → f ∈ B C
56 elmapfn ⊢ f ∈ B C → f Fn C
57 55 56 syl ⊢ φ ∧ f ∈ X → f Fn C
58 57 adantlr ⊢ φ ∧ g Fn C ∧ f ∈ X → f Fn C
59 58 3adant3 ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → f Fn C
60 53 3 54 59 fsneq ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g = f ↔ g ⁡ A = f ⁡ A
61 51 60 mpbird ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g = f
62 simp2 ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → f ∈ X
63 61 62 eqeltrd ⊢ φ ∧ g Fn C ∧ f ∈ X ∧ g ⁡ A ∈ ran ⁡ f → g ∈ X
64 63 3exp ⊢ φ ∧ g Fn C → f ∈ X → g ⁡ A ∈ ran ⁡ f → g ∈ X
65 9 33 64 syl2anc ⊢ φ ∧ g ∈ ran ⁡ ⋃ X C → f ∈ X → g ⁡ A ∈ ran ⁡ f → g ∈ X
66 65 rexlimdv ⊢ φ ∧ g ∈ ran ⁡ ⋃ X C → ∃ f ∈ X g ⁡ A ∈ ran ⁡ f → g ∈ X
67 31 66 mpd ⊢ φ ∧ g ∈ ran ⁡ ⋃ X C → g ∈ X
68 8 67 eqelssd ⊢ φ → X = ran ⁡ ⋃ X C