Theorem axdclem 10601

Description: Lemma for axdc 10603. (Contributed by Mario Carneiro, 25-Jan-2013.)

Hypothesis

Ref	Expression
axdclem.1	⊢ 𝐹 = (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω)

Assertion

Ref	Expression
axdclem	⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘𝐾)𝑥𝑧) → (𝐾 ∈ ω → (𝐹‘𝐾)𝑥(𝐹‘suc 𝐾)))

Distinct variable groups:   𝑦,𝐹,𝑧   𝑦,𝐾,𝑧   𝑦,𝑔   𝑦,𝑠   𝑥,𝑦,𝑧

Allowed substitution hints:   𝐹(𝑥, 𝑔, 𝑠)   𝐾(𝑥, 𝑔, 𝑠)

Proof of Theorem axdclem

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		neeq1 3017	. . . . . . 7 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → (𝑦 ≠ ∅ ↔ {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ≠ ∅))
2		abn0 4333	. . . . . . 7 ⊢ ({𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ≠ ∅ ↔ ∃𝑧(𝐹‘𝐾)𝑥𝑧)
3	1, 2	bitrdi 290	. . . . . 6 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → (𝑦 ≠ ∅ ↔ ∃𝑧(𝐹‘𝐾)𝑥𝑧))
4		eleq2 2849	. . . . . . . . 9 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → ((𝑔‘𝑦) ∈ 𝑦 ↔ (𝑔‘𝑦) ∈ {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))
5		breq2 5106	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑧 → ((𝐹‘𝐾)𝑥𝑤 ↔ (𝐹‘𝐾)𝑥𝑧))
6	5	cbvabv 2830	. . . . . . . . . 10 ⊢ {𝑤 ∣ (𝐹‘𝐾)𝑥𝑤} = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}
7	6	eleq2i 2852	. . . . . . . . 9 ⊢ ((𝑔‘𝑦) ∈ {𝑤 ∣ (𝐹‘𝐾)𝑥𝑤} ↔ (𝑔‘𝑦) ∈ {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧})
8	4, 7	bitr4di 292	. . . . . . . 8 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → ((𝑔‘𝑦) ∈ 𝑦 ↔ (𝑔‘𝑦) ∈ {𝑤 ∣ (𝐹‘𝐾)𝑥𝑤}))
9		fvex 6899	. . . . . . . . 9 ⊢ (𝑔‘𝑦) ∈ V
10		breq2 5106	. . . . . . . . 9 ⊢ (𝑤 = (𝑔‘𝑦) → ((𝐹‘𝐾)𝑥𝑤 ↔ (𝐹‘𝐾)𝑥(𝑔‘𝑦)))
11	9, 10	elab 3632	. . . . . . . 8 ⊢ ((𝑔‘𝑦) ∈ {𝑤 ∣ (𝐹‘𝐾)𝑥𝑤} ↔ (𝐹‘𝐾)𝑥(𝑔‘𝑦))
12	8, 11	bitrdi 290	. . . . . . 7 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → ((𝑔‘𝑦) ∈ 𝑦 ↔ (𝐹‘𝐾)𝑥(𝑔‘𝑦)))
13		fveq2 6886	. . . . . . . 8 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → (𝑔‘𝑦) = (𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))
14	13	breq2d 5114	. . . . . . 7 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → ((𝐹‘𝐾)𝑥(𝑔‘𝑦) ↔ (𝐹‘𝐾)𝑥(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧})))
15	12, 14	bitrd 282	. . . . . 6 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → ((𝑔‘𝑦) ∈ 𝑦 ↔ (𝐹‘𝐾)𝑥(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧})))
16	3, 15	imbi12d 347	. . . . 5 ⊢ (𝑦 = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} → ((𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ↔ (∃𝑧(𝐹‘𝐾)𝑥𝑧 → (𝐹‘𝐾)𝑥(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))))
17	16	rspcv 3572	. . . 4 ⊢ ({𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ∈ 𝒫 dom 𝑥 → (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) → (∃𝑧(𝐹‘𝐾)𝑥𝑧 → (𝐹‘𝐾)𝑥(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))))
18		fvex 6899	. . . . . . . 8 ⊢ (𝐹‘𝐾) ∈ V
19		vex 3454	. . . . . . . 8 ⊢ 𝑧 ∈ V
20	18, 19	brelrn 5923	. . . . . . 7 ⊢ ((𝐹‘𝐾)𝑥𝑧 → 𝑧 ∈ ran 𝑥)
21	20	abssi 3993	. . . . . 6 ⊢ {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ⊆ ran 𝑥
22		sstr 3916	. . . . . 6 ⊢ (({𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ⊆ ran 𝑥 ∧ ran 𝑥 ⊆ dom 𝑥) → {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ⊆ dom 𝑥)
23	21, 22	mpan 703	. . . . 5 ⊢ (ran 𝑥 ⊆ dom 𝑥 → {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ⊆ dom 𝑥)
24		vex 3454	. . . . . . 7 ⊢ 𝑥 ∈ V
25	24	dmex 7922	. . . . . 6 ⊢ dom 𝑥 ∈ V
26	25	elpw2 5295	. . . . 5 ⊢ ({𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ∈ 𝒫 dom 𝑥 ↔ {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ⊆ dom 𝑥)
27	23, 26	sylibr 237	. . . 4 ⊢ (ran 𝑥 ⊆ dom 𝑥 → {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧} ∈ 𝒫 dom 𝑥)
28	17, 27	syl11 34	. . 3 ⊢ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) → (ran 𝑥 ⊆ dom 𝑥 → (∃𝑧(𝐹‘𝐾)𝑥𝑧 → (𝐹‘𝐾)𝑥(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))))
29	28	3imp 1128	. 2 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘𝐾)𝑥𝑧) → (𝐹‘𝐾)𝑥(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))
30		fvex 6899	. . . 4 ⊢ (𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}) ∈ V
31		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑦𝑠
32		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑦𝐾
33		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑦(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧})
34		axdclem.1	. . . . 5 ⊢ 𝐹 = (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω)
35		breq1 5105	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝐾) → (𝑦𝑥𝑧 ↔ (𝐹‘𝐾)𝑥𝑧))
36	35	abbidv 2826	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝐾) → {𝑧 ∣ 𝑦𝑥𝑧} = {𝑧 ∣ (𝐹‘𝐾)𝑥𝑧})
37	36	fveq2d 6890	. . . . 5 ⊢ (𝑦 = (𝐹‘𝐾) → (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧}) = (𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))
38	31, 32, 33, 34, 37	frsucmpt 8450	. . . 4 ⊢ ((𝐾 ∈ ω ∧ (𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}) ∈ V) → (𝐹‘suc 𝐾) = (𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))
39	30, 38	mpan2 704	. . 3 ⊢ (𝐾 ∈ ω → (𝐹‘suc 𝐾) = (𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧}))
40	39	breq2d 5114	. 2 ⊢ (𝐾 ∈ ω → ((𝐹‘𝐾)𝑥(𝐹‘suc 𝐾) ↔ (𝐹‘𝐾)𝑥(𝑔‘{𝑧 ∣ (𝐹‘𝐾)𝑥𝑧})))
41	29, 40	syl5ibrcom 250	1 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘𝐾)𝑥𝑧) → (𝐾 ∈ ω → (𝐹‘𝐾)𝑥(𝐹‘suc 𝐾)))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ≠ wne 2955  ∀wral 3076  Vcvv 3450   ⊆ wss 3895  ∅c0 4278  𝒫 cpw 4556   class class class wbr 5102   ↦ cmpt 5185  dom cdm 5650  ran crn 5651   ↾ cres 5652  suc csuc 6364  ‘cfv 6539  ωcom 7878  reccrdg 8421

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-om 7879  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422

This theorem is used by:  axdclem2  10602