Theorem marypha2 9410

Description: Version of marypha1 9405 using a functional family of sets instead of a relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)

Hypotheses

Ref	Expression
marypha2.a	⊢ (𝜑 → 𝐴 ∈ Fin)
marypha2.b	⊢ (𝜑 → 𝐹:𝐴⟶Fin)
marypha2.c	⊢ ((𝜑 ∧ 𝑑 ⊆ 𝐴) → 𝑑 ≼ ∪ (𝐹 “ 𝑑))

Assertion

Ref	Expression
marypha2	⊢ (𝜑 → ∃𝑔(𝑔:𝐴–1-1→V ∧ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)))

Distinct variable groups:   𝜑,𝑑,𝑔,𝑥   𝐴,𝑑,𝑔,𝑥   𝐹,𝑑,𝑔,𝑥

Proof of Theorem marypha2

Step	Hyp	Ref	Expression
1		marypha2.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ Fin)
2		marypha2.b	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶Fin)
3	2, 1	unirnffid 9315	. . 3 ⊢ (𝜑 → ∪ ran 𝐹 ∈ Fin)
4		eqid 2760	. . . . 5 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))
5	4	marypha2lem1 9406	. . . 4 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹)
6	5	a1i 11	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ⊆ (𝐴 × ∪ ran 𝐹))
7		marypha2.c	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ⊆ 𝐴) → 𝑑 ≼ ∪ (𝐹 “ 𝑑))
8	2	ffnd 6704	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐴)
9	4	marypha2lem4 9409	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑑 ⊆ 𝐴) → (∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) “ 𝑑) = ∪ (𝐹 “ 𝑑))
10	8, 9	sylan 592	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ⊆ 𝐴) → (∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) “ 𝑑) = ∪ (𝐹 “ 𝑑))
11	7, 10	breqtrrd 5133	. . 3 ⊢ ((𝜑 ∧ 𝑑 ⊆ 𝐴) → 𝑑 ≼ (∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) “ 𝑑))
12	1, 3, 6, 11	marypha1 9405	. 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))𝑔:𝐴–1-1→∪ ran 𝐹)
13		df-rex 3087	. . 3 ⊢ (∃𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))𝑔:𝐴–1-1→∪ ran 𝐹 ↔ ∃𝑔(𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹))
14		ssv 3955	. . . . . . . 8 ⊢ ∪ ran 𝐹 ⊆ V
15		f1ss 6779	. . . . . . . 8 ⊢ ((𝑔:𝐴–1-1→∪ ran 𝐹 ∧ ∪ ran 𝐹 ⊆ V) → 𝑔:𝐴–1-1→V)
16	14, 15	mpan2 704	. . . . . . 7 ⊢ (𝑔:𝐴–1-1→∪ ran 𝐹 → 𝑔:𝐴–1-1→V)
17	16	ad2antll 742	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹)) → 𝑔:𝐴–1-1→V)
18		elpwi 4564	. . . . . . . 8 ⊢ (𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) → 𝑔 ⊆ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)))
19	18	ad2antrl 741	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹)) → 𝑔 ⊆ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)))
20		f1fn 6773	. . . . . . . . 9 ⊢ (𝑔:𝐴–1-1→∪ ran 𝐹 → 𝑔 Fn 𝐴)
21	20	ad2antll 742	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹)) → 𝑔 Fn 𝐴)
22	4	marypha2lem3 9408	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑔 Fn 𝐴) → (𝑔 ⊆ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ↔ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)))
23	8, 21, 22	syl2an2r 698	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹)) → (𝑔 ⊆ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ↔ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)))
24	19, 23	mpbid 235	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹)) → ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))
25	17, 24	jca 521	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹)) → (𝑔:𝐴–1-1→V ∧ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)))
26	25	ex 418	. . . 4 ⊢ (𝜑 → ((𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹) → (𝑔:𝐴–1-1→V ∧ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))))
27	26	eximdv 1950	. . 3 ⊢ (𝜑 → (∃𝑔(𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) ∧ 𝑔:𝐴–1-1→∪ ran 𝐹) → ∃𝑔(𝑔:𝐴–1-1→V ∧ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))))
28	13, 27	biimtrid 245	. 2 ⊢ (𝜑 → (∃𝑔 ∈ 𝒫 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))𝑔:𝐴–1-1→∪ ran 𝐹 → ∃𝑔(𝑔:𝐴–1-1→V ∧ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))))
29	12, 28	mpd 16	1 ⊢ (𝜑 → ∃𝑔(𝑔:𝐴–1-1→V ∧ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  ∪ cuni 4867  ∪ ciun 4951   class class class wbr 5103   × cxp 5653  ran crn 5656   “ cima 5658   Fn wfn 6528  ⟶wf 6529  –1-1→wf1 6530  ‘cfv 6533   ≼ cdom 8951  Fincfn 8953

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-om 7864  df-1st 7987  df-2nd 7988  df-1o 8456  df-er 8697  df-en 8954  df-dom 8955  df-sdom 8956  df-fin 8957

This theorem is used by: (None)